Cod sursa(job #196646)
| Utilizator | Data | 27 iunie 2008 18:09:54 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream.h>
#include <fstream.h>
int main()
{typedef enum {NU,DA} set;
set a[2000001];
long n,i,j,nr;
fstream f("ciur.in",ios::in);
fstream g("ciur.out",ios::out);
f>>n;
f.close();
for (i=2; i<=n; i++) a[i]=DA;
for (i=2; i<=n/2; i++)
if (a[i]==DA)
for (j=i+i; j<=n; j+=i)
a[j]=NU;
for (nr=0,i=2; i<=n; i++)
if (a[i]==DA) nr++;
g<<nr;
g.close();
return(0);
}
