Cod sursa(job #148909)
Utilizator | Loganel loganel | Data | 4 martie 2008 23:07:32 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<stdio.h>
#define M 2000001
char v[M];
long w[7000];
int main()
{long n,i,j,k=0;
FILE *f=fopen("ciur.in","r");
FILE *g=fopen("ciur.out","w");
fscanf (f,"%ld",&n);
k=0;
for(i=2;i*i<=n;i++)
if(v[i]==0) for(j=i+i;j<=n;j+=i)
v[j]=1;
k=1;v[k]=2;
for(i=3;i<=n;i+=2)
if(v[i]==0){ k++;w[k]=i;}
fprintf(g,"%ld\n",k);
if(k>1000) k=1000;
for(i=1;i<=k;i++)
fprintf(g,"%ld ",w[i]);
fprintf(g,"\n");
fclose(f);
fclose(g);
return 0;
}