Cod sursa(job #525780)
Utilizator | Data | 26 ianuarie 2011 11:03:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
int i,nr,n,j,prim[2000100];
int main ()
{
f>>n;
nr=0;
for (i=2;i<=n;i++)
if (!prim[i])
for (j=i+i;j<=n;j+=i)
prim[j]=1;
for (i=2;i<=n;i++)
if(!prim[i])
nr++;
g<<nr;
return 0;
}