C语言 > 构造素数表

 1 #include <stdio.h>
 2 #define NUMBER 1000
 3 
 4 int main(){
 5     int isPrime[NUMBER];
 6     for (int i = 0; i < NUMBER; i++){
 7         isPrime[i] = 1;
 8     }
 9     int x = 2;
10     while (x < NUMBER){
11         if (isPrime[x]){
12             for (int i = 2; x*i < NUMBER; i++){
13                 isPrime[x*i] = 0;
14             }
15         }
16         x++;
17     }
18     for (int i = 2 ; i < NUMBER; i++){
19         if (isPrime[i]) {
20             printf("%d\t", i);
21         }
22     }
23     return 0;
24 }