Cod sursa(job #520410)
Utilizator | Data | 8 ianuarie 2011 14:48:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <stdio.h>
FILE *f,*g;
int n,nr;
char v[2000001];
int main(void) {
int i,j;
f=fopen("ciur.in","r");
g=fopen("ciur.out","w");
fscanf(f,"%d",&n);
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(g);
fclose(f);
return 0;
}