Cod sursa(job #285122)
Utilizator | Data | 22 martie 2009 13:08:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
int v[2000000];
int main()
{unsigned long n,k,i,j;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n; k=1;
for(i=3;i<=n;i+=2)
if(v[i]==0)
{k++;
for(j=i;j<=n;j+=i)
v[j]=1;
}
g<<k<<'\n';
f.close();
g.close();
return 0;
}