Cod sursa(job #291358)
Utilizator | Data | 29 martie 2009 18:26:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | The Beginners | Marime | 0.36 kb |
#include <fstream.h>
#define marime 2000001
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
long unsigned i,n,k,p=0;
char a[marime];
f>>n;
for(i=1;i<=n;i++)
a[i]=1;
a[1]=0; for(i=2;i<=n;i++)
if(a[i]!=0)
{ for(k=i+i;k<=n;k=k+i)
a[k]=0;
}
for(i=1;i<=n;i++) {if(a[i]!=0) p++;}
g<<p;
f.close();g.close();
return 0;
}