Cod sursa(job #1996629)
| Utilizator | Data | 2 iulie 2017 09:28:47 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <iostream>
using namespace std;
const int MAXN = 2000000;
bool mark[1 + MAXN];
int main() {
#ifdef INFOARENA
ifstream cin("ciur.in");
ofstream cout("ciur.out");
#endif
int n; cin >> n;
int answer = 0;
for (int i = 2; i <= n; ++i) {
if (!mark[i]) {
++answer;
}
for (int j = i + i; j <= n; j += i) {
mark[j] = true;
}
}
cout << answer << '\n';
}
