Cod sursa(job #1494766)
Utilizator | Data | 1 octombrie 2015 20:57:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <cstdio>
#define nmx 2000002
using namespace std;
int main() {
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
bool viz[nmx];
int nr,sum = 0;
scanf("%d", &nr);
for(int i = 2; i <= nr; ++i)
if(not viz[i]) {
++sum;
for(int j = 2*i; j <= nr; j += i)
viz[j] = 1;
}
printf("%d\n", sum);
return 0;
}