Cod sursa(job #168099)
Utilizator | Data | 30 martie 2008 18:50:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream.h>
#define dim 2000004
char ciur[dim];
int n,k;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
f>>n;
for (int i=2;i<=n;++i)
ciur[i]=1;
for (i=2;i<=n;++i)
if (ciur[i])
for (int j=2;j<=n/i;++j)
ciur[i*j] = 0;
for(i=2;i<=n;i++)
if(ciur[i])
k++;
g<<k;
f.close();
g.close();
return 0;
}