Cod sursa(job #180395)
Utilizator | Data | 16 aprilie 2008 23:15:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <stdio.h>
#define nm 2000100
int n, sol;
char v[nm];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
for (int i = 2; i <= n; ++i)
if (!v[i]) {
++sol;
for (int j = i + i; j <= n; j += i)
v[j] = 1;
}
printf("%d\n", sol);
return 0;
}