Cod sursa(job #1240740)
Utilizator | Data | 11 octombrie 2014 23:19:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <stdio.h>
#include <stdlib.h>
int n, i, j, v[1000005], k;
int main()
{
freopen ("ciur.in", "r", stdin);
freopen ("ciur.out", "w", stdout);
scanf("%d", &n);
for(i = 2; i <= n; i++)
{
for(j = i + i; j <= n; j += i)
{
v[j] = 1;
}
}
for(i = 2; i <= n; i++)
if(v[i] == 0)
k++;
printf("%d", k);
return 0;
}