Cod sursa(job #2675108)
Utilizator | Data | 21 noiembrie 2020 10:07:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
bool notPrime[2000000];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int N, nrp=0;
fin>>N;
for(int d=2; d<N; d++)
{
if(notPrime[d]!=0)
{
continue;
}
for(int i=2*d; i<=N; i+=d)
{
notPrime[i]=true;
}
}
for (int d=2; d<N; d++)
{
if (notPrime[d]==0)
{
nrp++;
}
}
fout<<nrp;
return 0;
}