Pagini recente » Cod sursa (job #291569) | Cod sursa (job #409813) | Istoria paginii jc2020/solutii/papagali | Cod sursa (job #249980) | Cod sursa (job #1856755)
#include <cstdio>
using namespace std;
const int N=200000;
long long e[N+1];
FILE *fin,*fout;
int main()
{ fin=fopen("sum.in","r");
fout=fopen("sum.out","w");
long long t,n,i,j;
fscanf(fin,"%lld",&t);
for(i=1; i<=N; i++)
e[i]=i;
for(i=2; i<=N; i++)
if(e[i]==i)
for(j=i; j<=N; j+=i)
e[j]=e[j]/i*(i-1);
for(i=1;i<=t;i++)
{
fscanf(fin,"%lld",&n);
fprintf(fout,"%lld\n",e[n]*n*2);
}
return 0;
}