更新时间:2022-04-20 08:45:54
1 #include <stdio.h> 2 #include <math.h> 3 4 #define MAX 10000 5 #define YES 1 6 #define NO 0 7 8 //prototype 9 int judge(int judge_num); 10 11 int prime[MAX]={2,3,5}; 12 int N=100; 13 int count=3; 14 15 int main() 16 { 17 int index=0; 18 int num; 19 for(index=1;index*6+5<=N;index++) //Just test 6*n+1,6*n+5 20 { 21 num=6*index+1; 22 if(judge(num)==YES) 23 prime[count++]=num; 24 num=6*index+5; 25 if(judge(num)==YES) 26 prime[count++]=num; 27 } 28 for(index=0;index<count;index++) 29 printf("%d ",prime[index]); 30 printf("\n"); 31 } 32 33 int judge(int judge_num) 34 { 35 int index=0; 36 for(index=0;prime[index]*prime[index]<=judge_num;index++) 37 { 38 if((judge_num%prime[index])==0) 39 return NO; 40 } 41 return YES; 42 }