Pagini recente » Cod sursa (job #189410) | Cod sursa (job #2132132) | Cod sursa (job #873426) | Cod sursa (job #2172223) | Cod sursa (job #963737)
Cod sursa(job #963737)
#include<cstdio>
#include<algorithm>
#include<cstring>
#define nmax 100000
using namespace std;
int n,i,j,k,x,y,m;
int phi[nmax+1];
int main()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
scanf("%d",&n);
for (i=2;i<=nmax;i++) phi[i]=i-1;
phi[1]=1;
for (i=2;i<=nmax;i++)
{
for (j=i+i;j<=nmax;j+=i)
phi[j]-=phi[i];
}
for (i=1;i<=n;i++)
{
scanf("%d",&x);
printf("%lld\n",(long long)phi[x]*x*2);
}
return 0;
}