Cod sursa(job #416606)
Utilizator | Data | 13 martie 2010 00:17:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<stdio.h>
FILE *f,*g;
long i,n,j,nr; int viz[2100000];
int main()
{ f=fopen("ciur.in","r"); g=fopen("ciur.out","w");
fscanf(f,"%ld",&n);
i=2;
while(i<=n)
{ if(!viz[i])
{ nr++; j=2*i; while(j<n) { viz[j]=1; j+=i; }}
if(i!=2) i+=2; else i++;
}
fprintf(g,"%ld",nr);
fclose(g);
return 0;
}