Cod sursa(job #2099914)
Utilizator | Data | 4 ianuarie 2018 20:26:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N,v[2000000],j,nrp,i;
int main()
{
fin>>N;
for(i=2;i<=N;++i)v[i]=1;
for(i=2;i<=N;++i)
{
if(v[i]==1)
{
++nrp;
for(j=i+i;j<=N;j+=i)v[j]=0;
}
}
fout<<nrp;
return 0;
}