Cod sursa(job #308515)
Utilizator | Data | 27 aprilie 2009 16:24:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<stdio.h>
FILE *f=fopen("ciur.in","r"),
*g=fopen("ciur.out","w");
char a[2000003];
int i,n,nr,k;
int main()
{ fscanf(f,"%d",&n);
for(i=2;i<=n;i++) { if(!a[i]) nr++;
for(k=i;i*k<=n;k++) a[i*k]=1;
}
fprintf(g,"%d\n",nr);
fclose(f);
fclose(g);
return 0;
}