-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathprog2_2.c
54 lines (45 loc) · 1.04 KB
/
prog2_2.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include <time.h>
#include <stdio.h>
// #include "mpi.h"
int prime(int rank , int size , int num)
{
int count = 2,i,j,lo,hi;
for( i = 6 ; i-1 <= num ; i += 6 )
{
lo = 1;
hi = 1;
for( j = 6 ; (j-1)*(j-1) <= i+1 ; j += 6 )
{
if(lo==1)
if( (i-1) % (j-1) == 0 || (i-1) % (j+1) == 0 )
{
lo = 0;
}
if(hi==1)
if( (i+1) % (j-1) == 0 || (i+1) % (j+1) == 0 )
{
hi = 0;
}
}
count += lo;
if(i+1 <= num && hi == 1)
count++;
if( (i/6)%10000 == 0 )printf("%d,%d\n",i,count);
}
return count;
}
int main(int argc, char *argv[])
{
int rank = 0;
int size = 1;
int n = 2147483647;
while( scanf(" %d",&n) != EOF ){
clock_t s,e;
s = clock();
int result = prime(rank,size,n);
e = clock();
float ti = (float) (e-s) / CLOCKS_PER_SEC;
printf("%d %f\n",result,ti);
}
return 0;
}