Cod sursa(job #144574)
Utilizator | Data | 27 februarie 2008 19:42:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<stdio.h>
int k,n,i,j,sol[200000];
char v[2000000];
int main(){
FILE *f=fopen("ciur.in","r");
fscanf(f,"%d",&n);
fclose(f);
for(i=2;i<=n;i++){
if(v[i]==0){
k++;
sol[k]=i;
for(j=i;j<=n;j+=i){
v[j]=1;
}
}
}
FILE *g=fopen("ciur.out","w");
fprintf(g,"%d\n",k);
if(k<=1000){
for(i=1;i<=k;i++){
fprintf(g,"%d ",sol[i]);
}
}
else{
for(i=k-1000+1;i<=k;i++){
fprintf(g,"%d ",sol[i]);
}
}
fclose(g);
return 0;
}