Pagini recente » Cod sursa (job #930033) | Cod sursa (job #2791029) | Cod sursa (job #3142398) | Cod sursa (job #1723594) | Cod sursa (job #482182)
Cod sursa(job #482182)
#include <stdio.h>
#define MAX 100001
long long sum;
long n, x, j, i;
long long v[MAX];
void ciur()
{
for (i = 1; i <= MAX; ++i)
v[i] = i-1;
for (i = 2; i <= MAX; ++i)
for (j = 2*i; j <= MAX; j += i)
v[j] -= v[i];
}
int main()
{
ciur();
FILE *f = fopen ("sum.in","r");
FILE *g = fopen ("sum.out","w");
fscanf(f,"%ld\n", &n);
for (i=1; i<=n; i++)
{
fscanf (f,"%ld\n", &x);
sum = v[x] * x * 2;
fprintf (g,"%lld\n", sum);
}
fclose(f);
fclose(g);
return 0;
}