昊昊的专栏

#include void main(){ int i; int N,count,p=0; int r[1001];//限制数据量大小为1000 printf("你想求多少以内的素数:"); scanf("%d",&N); for(i=1;i<=N;i++)//为方便计，从1起 r[i]=1; count=2;//筛选起点为2 while(count<=N/2){//显然：count不会超过N/2

#include int mark[100]; int num[100]; int n; int flag[100]; void prime() { int i, j; flag[0] = flag[1] = 1; for(i = 2; i <= 50; i ++){ if(flag[i] == 0){ for(j = i + i; j <= 100; j = j + i){

#include #include #define MAX_SIZE 10001 int flag[MAX_SIZE]; int a[MAX_SIZE]; int main() { int sum; int N, M; int i, j; scanf("%d",&M); flag[0] = flag[1] = 1; for(i = 2; i <= sqrt(MAX_SIZE); i +

#include #include int flag[1000]; int main() { int a; int i,j; while(1){ scanf("%d",&a); for(i = 2; i <= sqrt(a); i ++) { if(flag[i] == 0 ) { for( j = i + i; j <= a; ) { fl

#include #include #define MAX_SIZE 2000001／／注意：define 没有 分号 int flag[MAX_SIZE]; int main() { int a; int i, j; flag[0] = flag[1] = 1; for(i = 2; i <= sqrt(MAX_SIZE); i ++)//遍历了所有的数并进行标记 { if(fl