Cod sursa(job #775585)
Utilizator | Data | 8 august 2012 15:53:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <stdio.h>
const int v_LIMIT = 2000000;
bool v[v_LIMIT];
int c = 0, n;
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
for(size_t i = 2; i * i <= n; i++)
if(v[i] == false)
for(size_t k = i * i; k <= n; k += i)
v[k] = true, c++;
printf("%d", n - c - 1);
return 0;
}