Pagini recente » Cod sursa (job #569158) | Cod sursa (job #373559) | Cod sursa (job #3252876) | Cod sursa (job #2357994) | Cod sursa (job #210688)
Cod sursa(job #210688)
#include<stdio.h>
int n,i,j, w[100001];
int phi(int n){
int k=0,v[100009]={0};
for(i=2; i<=n;++i)
if(v[i]==0)
if(n%i==0)
for(j=i; j<=n;j=j+i)
if(v[j]==0)
{
k++;
v[j]=1;
}
return 2*n*(n-k);
}
int main(){
freopen("sum.in","r", stdin);
freopen("sum.out", "w", stdout);
int x;
scanf("%d", &x);
for(int a=1; a<=x; ++a){
scanf("%d", &n);
printf("%d\n", phi(n));
}
return 0;
}