Pagini recente » Cod sursa (job #96753) | Cod sursa (job #3157385) | Cod sursa (job #1162277) | Cod sursa (job #2801972) | Cod sursa (job #980544)
Cod sursa(job #980544)
#include <cstdio>
using namespace std;
int n, i, x, z, j, phi[100001];
long long sum;
int main()
{
freopen("sum.in", "r", stdin);
freopen("sum.out", "w", stdout);
scanf("%d", &n);
for(i=2;i<=100001;++i) phi[i]=i-1;
for(i=2;i<=100001;++i)
for(j=2*i;j<=100001;j+=i)
phi[j]-=phi[i];
for(i=1;i<=n;++i)
{
scanf("%d", &x);
printf("%lld\n", (long long)(2*x*phi[x]));
}
return 0;
}