Cod sursa(job #209029)
Utilizator | Data | 20 septembrie 2008 11:28:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
using namespace std;
#include<fstream>
int main ()
{
int N, i, j, nr=0;
bool phi[2000005];
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>N;
for(i=2;i<=N;i++)
phi[i]=1;
for(i=2;i*i<=N;i++)
{
if(phi[i])
{
for(j=i*i;j<=N;j+=i)
phi[j]=0;
}
}
for(i=2;i<=N;++i)
if(phi[i])
++nr;
out<<nr;
in.close();out.close();
return 0;
}