Cod sursa(job #2879423)
Utilizator | Data | 28 martie 2022 15:58:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n, v[2000001], sol;
int main() {
for (int i = 2; i * i <= 2000000; ++i)
if (v[i] == 0)
for (int j = i * i; j <= 2000000; j += i)
v[j] = 1;
cin >> n;
for (int i = 2; i <= n; ++i)
if (v[i] == 0)
++sol;
cout << sol;
cin.close();
cout.close();
return 0;
}