Cod sursa(job #2379662)
Utilizator | Data | 13 martie 2019 21:41:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
int n,i,prim[2000005],nrp,j;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for (i = 2; i <= n; ++i)
prim[i] = 1;
for (i = 2; i <= n; ++i)
if (prim[i])
{
++nrp;
for (j = i+i; j <= n; j += i)
prim[j] = 0;
}
fout<<nrp;
return 0;
}