Cod sursa(job #2604104)
Utilizator | Data | 21 aprilie 2020 17:02:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#define NMAX 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int cnt, n, v[NMAX], i, j;
void ciur()
{
for (i = 1; i <= n; i++)
v[i] = 1;
v[0] = v[1] = 0;
for (i = 2; i <= n; i++){
if (v[i] == 1)
for (j = 2; j * i <= n; j++)
v[j * i] = 0;
}
}
int main()
{
fin >> n;
ciur();
for (i = 1; i <= n; i++)
if (v[i] == 1)
cnt++;
fout << cnt;
return 0;
}