Cod sursa(job #332809)
Utilizator | Data | 20 iulie 2009 09:19:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream.h>
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
long long int n;
int i,nr=0,j;
char prim[2000005];
f>>n;
f.close();
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+=i)
prim[j]=0;
}
g<<nr;
g.close();
return 0;
}