Cod sursa(job #477031)
Utilizator | Data | 13 august 2010 02:00:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <cstdio>
FILE*f=fopen("ciur.in","r");
FILE*g=fopen("ciur.out","w");
char prim[2000001];
int main(){
int x,nr=0,k;
fscanf(f,"%d",&x);
for(int i=2;i <= x;i++){
if(!prim[i]){
nr++;
k=1;
for(int j=i;j<=x;j=i*k++){
prim[j]=1;
}
}
}
fprintf(g,"%d",nr);
fclose(f);
fclose(g);
return 0;
}