Cod sursa(job #1923759)
| Utilizator | Data | 12 martie 2017 00:37:00 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <stdio.h>
#include <stdlib.h>
int n, nrprime, i, j;
unsigned char prim[2000005];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
for (i = 2; i <= n; i++)
prim[i] = 1;
for (i = 2; i <= n; i++)
if (prim[i] == 1)
{
nrprime++;
for (j = i + i; j <= n; j = j + i)
prim[j] = 0;
}
printf("%d\n", nrprime);
}