Cod sursa(job #2737587)
Utilizator | Data | 4 aprilie 2021 21:15:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
int N;
bool arr[2000002];
int main() {
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
cin >> N;
int ans = 0;
for(int i = 2; i <= N; i++) {
if(!arr[i]) {
ans++;
for(int j = i; j <= N; j += i) {
arr[j] = true;
}
}
}
cout << ans;
}