Cod sursa(job #1485789)
Utilizator | Data | 12 septembrie 2015 23:25:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<cstdio>
int n,i,j,v[2001000],nr;
FILE *f,*g;
int main(){
f=fopen("ciur.in","r");
g=fopen("ciur.out","w");
fscanf(f,"%d",&n);
v[1]=1;
for(i=2;i<=n;i++){
if(v[i]==0){
nr++;
for(j=i+i;j<=n;j+=i){
v[j]=1;
}
}
}
fprintf(g,"%d",nr);
fclose(f);
fclose(g);
return 0;
}