Cod sursa(job #1643066)
Utilizator | Data | 9 martie 2016 17:24:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#define NN 2000001
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,v[NN],nr;
int main()
{
fin>>n;
v[0]=v[1]=1;
for(i=2;i*i<=n;i++)
if(v[i]==0)
for(j=2;j*i<=n;j++)
v[i*j]=1;
for(i=2;i<=n;i++)
if(v[i]==0)
nr++;
fout<<nr;
fin.close();
fout.close();
return 0;
}