Pagini recente » Cod sursa (job #2049145) | Istoria paginii runda/ojiprep1/clasament | Cod sursa (job #1386764) | Cod sursa (job #961257) | Cod sursa (job #191794)
Cod sursa(job #191794)
#include <stdio.h>
int N, cnt;
char prim[2000005];
int main(void)
{
int i, j;
freopen("fractii.in", "r", stdin);
freopen("fractii.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\n", cnt*N*2);
return 0;
}