Cod sursa(job #2172001)
Utilizator | Daniel Rusu DanielRusu | Data | 15 martie 2018 14:33:41 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int ans, N, CE[2000005];
void Ciur() {
CE[0] = CE[1] = 1;
for(int i = 2; i <= N; ++i) {
if(CE[i] == 0) {
++ans;
for(int j = i * i; j <= N; j += i) {
CE[j] = 1;
}
}
}
}
int main() {
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d", &N);
Ciur();
cout << ans << '\n';
return 0;
}