Pagini recente » Cod sursa (job #3285120) | Cod sursa (job #1788054) | Cod sursa (job #3349887) | Cod sursa (job #162510) | Cod sursa (job #1393176)
#include <cstdio>
#include <cmath>
long long sum,phi;
int n,x;
int div[501];
int main()
{
freopen ("sum.in","r",stdin);
freopen ("sum.out","w",stdout);
scanf("%d",&x);
for(int vv=1;vv<=x;vv++)
{
scanf("%d",&n);
phi=n;
int temp=n;
int p=1;
int si=(int)sqrt(n)+1;
if(n%2==0)
{
phi/=2;
while(n%2==0) n/=2;
}
for(int j=3;j<=si;j+=2)
{
if(n%j==0)
{
phi/=j;
phi*=(j-1);
while(n%j==0) n/=j;
}
}
if(n!=1)
{
phi/=n;
phi*=(n-1);
}
sum=(long long)2*temp*phi;
printf("%lld\n",sum);
}
}