Cod sursa(job #1839186)
Utilizator | Data | 2 ianuarie 2017 16:21:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <stdio.h>
int n, nr;
char p[2000005];
int main()
{
int i, j;
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
for (i = 2; i <= n; ++i)
p[i] = 0;
for (i = 2; i <= n; ++i)
if (p[i] == 0)
{
++nr;
for (j = i + i; j <= n; j+= i)
p[j] = 1;
}
printf("%d\n", nr);
return 0;
}