Cod sursa(job #2608165)
Utilizator | Data | 30 aprilie 2020 18:40:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <cstdio>
bool v[2000005];
int main() {
int n, i, j, rez = 0;
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
for(i = 2; i <= n; ++i)
if(v[i] == 0) {
++rez;
if(i <= 1414)
j = i*i;
else
j = i+i;
for(j; j <= n; j += i)
v[j] = 1;
}
printf("%d ", rez);
}