Pagini recente » Borderou de evaluare (job #3256661) | Cod sursa (job #2144709) | Cod sursa (job #483756) | Cod sursa (job #1104569) | Cod sursa (job #118136)
Cod sursa(job #118136)
#include <cstdio>
const int maxn = 100001;
FILE *in = fopen("sum.in","r"), *out = fopen("sum.out","w");
int n;
int phi[maxn];
int main()
{
fscanf(in, "%d", &n);
for (int i = 1; i <= 100000; ++i)
phi[i] = i-1;
for ( int i = 2; i <= 100000; ++i )
for ( int j = i << 1; j <= 100000; j += i )
phi[j] -= phi[i];
int x;
for ( int i = 1; i <= n; ++i )
{
fscanf(in, "%d", &x);
fprintf(out, "%lld\n", (long long)(phi[x]*x) << 1);
}
return 0;
}