Cod sursa(job #3151504)
Utilizator | Data | 21 septembrie 2023 17:13:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n;
bool ciur[2000005];
int main()
{
in >> n;
int ans = 0;
for (int i = 2; i <= n; i++) {
if (ciur[i] == 0) {
ans++;
for (int j = 2; i * j <= n; j++)
ciur[i * j] = 1;
}
}
out << ans;
return 0;
}