Pagini recente » Istoria paginii utilizator/deliap | Cod sursa (job #2097246) | Rating Kerem Uteu (Keremutz) | Cod sursa (job #1985953) | Cod sursa (job #489058)
Cod sursa(job #489058)
#include <stdio.h>
int main(void) {
int i, j, n, count;
char prim[2000005];
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%lu", &n);
for(j = 2; j <= n; ++j)
prim[j] = 1;
for(j = 2; j <= n; ++i)
if(prim[j]) {
++count;
for(i = j + j; i <= n; i += j)
prim[i] = 0;
}
printf("%d\n", count);
return 0;
}