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