Cod sursa(job #631989)
| Utilizator | Data | 9 noiembrie 2011 23:30:50 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cstdio>
#define MAX_N 2000010
using namespace std;
int n, np;
char prime[MAX_N];
int main() {
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
np = 1;
for(int i = 3; i <= n; i += 2)
if(prime[i] == 0) {
np ++;
for(int j = 3 * i; j <= n; j += 2 * i)
prime[j] = 1;
}
printf("%d\n", np);
return 0;
}
