Cod sursa(job #262298)
Utilizator | Data | 19 februarie 2009 11:08:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
long n,nr,i,j;
char v[2000001];
int main ()
{
f>>n;
nr=1;
for (i=3;i<=n;i=i+2)
if (v[i]==0)
{
nr++;
for (j=i+i;j<=n;j=j+i)
v[j]=1;
}
g<<nr<<'\n';
f.close ();
g.close ();
return 0;
}