to find prime number between 0 and 100.
1 #include
2 #include
3
4 #define N 101
5
6 int main()
7 {
8 int j,i,array[N];
9 int tmp_sqrt_N;
10
11 //赋值
12 for(i=2;i 13 array[i] = i;
14
15 //为了防止出现重复打印,也为了打印美观，要用到数组标志。比如12，有3，4，那么设置a[12]=0;
16 for(j=3;j 17 {
18 tmp_sqrt_N = sqrt(j);
19
20 for(i=2;i<=tmp_sqrt_N;i++)
21 if(array[j]%i==0)
22 {
23 array[j]=0;
24 }
25 }
26
27 //打印质数
28 j =0;
29 for(i=2;i 30 {
31 if(array[i]!=0)
32 {
33 printf("%d ",array[i]);
34 j++;
35 }
36 if(j==10 || i==N-1)
37 { j = 0;
38 printf("\n");
39 }
40 }
41
42 return 0;
43 }
摘自 zhengmian
|