Cod sursa(job #172108)
Utilizator | Data | 5 aprilie 2008 19:21:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream.h>
int n,cnt;
char prim[2000005];
int main()
{
int i,j;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=2;i<=n;++i)
prim[i]=1;
for(i=2;i<=n;++i)
if(prim[i])
{
++cnt;
for(j=i+i;j<=n;j+=i)
prim[j] = 0;
}
fout<<cnt<<"\n";
return 0;
}