Cod sursa(job #960765)
Utilizator | Data | 11 iunie 2013 02:46:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<cstdio>
int n,i,j,np;
bool v[2000001];
FILE *f,*g;
int main(){
f=fopen("ciur.in","r");
g=fopen("ciur.out","w");
fscanf(f,"%d",&n);
for(i=2;i<=n;i++){
v[i]=1;
}
np=0;
for(i=2;i<=n;i++){
if(v[i]==1){
for(j=2*i;j<=n;j+=i){
v[j]=0;
}
np++;
}
}
fprintf(g,"%d",np);
fclose(f);
fclose(g);
return 0;
}