Cod sursa(job #1418210)
Utilizator | Data | 12 aprilie 2015 13:08:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <cstdio>
#include <math.h>
using namespace std;
int ciur[2000005];
int main() {
int N, cnt, i, j;
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d",&N);
cnt = 0;
for(i = 2; i <= N; ++i) {
if(!ciur[i]) {
++cnt;
for(j = i+i; j <= N; j=j+i) {
ciur[j] = 1;
}
}
}
printf("%d",cnt);
return 0;
}