Cod sursa(job #153698)
Utilizator | Data | 10 martie 2008 18:10:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream.h>
long long p[2000005],n,i,j,nr;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
p[i]=1;
for(i=2;i<=n;i++)
if(p[i])
{
nr++;
for(j=i+i;j<=n;j=j+i)
p[j]=0;
}
g<<nr;
return 0;
}