Cod sursa(job #918280)
Utilizator | Data | 18 martie 2013 19:02:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
bool v[200000000];
int main()
{
v[0]=v[1]=1;
int i,nr=0,n;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=2;i<=n;++i)
if(v[i]==0)
{
for(int j=2*i;j<=n;j+=i)
v[j]=1;
}
for(i=1;i<=n;++i)
if(v[i]==0)
++nr;
fout<<nr;
return 0;
}