Cod sursa(job #3370997)
| Utilizator | Data | 28 octombrie 2026 11:13:41 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, cnt = 0;
bool prim[2000001];
fin >> n;
for (int i = 0; i <= n; i++)
prim[i] = true;
prim[0] = prim[1] = false;
for (int i = 2; i * i <= n; i++)
if (prim[i])
for (int j = i * i; j <= n; j += i)
prim[j] = false;
for (int i = 2; i <= n; i++)
if (prim[i])
cnt++;
fout << cnt;
return 0;
}
