Pagini recente » Cod sursa (job #264651) | Cod sursa (job #223407) | Cod sursa (job #1949230) | Cod sursa (job #314459) | Cod sursa (job #639902)
Cod sursa(job #639902)
#include <stdio.h>
#include <stdlib.h>
#define LEN 10000001
unsigned long long count, i, j, n, phi[LEN];
int
main(void)
{
freopen("fractii.in", "r", stdin);
scanf("%d", &n);
for (i = 1; i <= n; i++)
phi[i] = i;
for (i = 2; i <= n; i++)
{
if (phi[i] == i)
for (j = i; j <= n; j += i)
phi[j] /= i, phi[j] *= (i - 1);
count += (long long)2 * phi[i];
}
fprintf(freopen("fractii.out", "w", stdout), "%lld", count + 1);
return 0;
}