Cod sursa(job #652953)
Utilizator | Data | 26 decembrie 2011 21:38:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
# include <iostream>
# include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long n,k,i,p[2000001],j;
int main()
{
f>>n;
f.close();
k=0;
for(i=2;i<=n/2;++i)
{
if(p[i]==0)
{
for(j=i+i;j<=n;j=j+i)
{
p[j]=1;
}
}
}
for(i=2;i<=n;i++)
{
if(p[i]==0) k++;
}
g<<k<<'\n';
g.close();
return 0;
}