Cod sursa(job #3273256)
Utilizator | Data | 1 februarie 2025 13:06:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
int n, v[2000001], fr[20000001];
ifstream cin ("ciur.in");
ofstream cout ("ciur.out");
int main() {
cin >> n;
v[1] = 1;
for (int i = 2; i * i <= n; ++i) {
if (v[i] == 0) {
for (int j = 2; j <= n / i; ++j) {
v[i * j] = 1;
}
}
}
for (int i = 1; i <= n; ++i) {
++fr[v[i]];
}
cout << fr[0];
return 0;
}