Pagini recente » Cod sursa (job #30674) | Borderou de evaluare (job #2605132) | Borderou de evaluare (job #2509665) | Borderou de evaluare (job #1470881) | Cod sursa (job #893715)
Cod sursa(job #893715)
#include <stdio.h>
int N, cnt;
char prim[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)
prim[i] = 1;
for (i = 2; i <= N; ++i)
if (prim[i])
{
++cnt;
for (j = i + i; j <= N; j += i)
prim[j] = 0;
}
printf("%d", cnt);
return 0;
}