Pagini recente » Cod sursa (job #1911918) | Istoria paginii algoritmiada-2019/runda-maraton/solutii/tubeyou | Cod sursa (job #2746664) | Cod sursa (job #227986) | Cod sursa (job #1886422)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("sum.in");
ofstream fout("sum.out");
int ind[100100];
int n,x,ans,j,i;
int main()
{
fin>>n;
for(i=1; i<=100000; ++i)
ind[i]=i;
for(i=2; i<=100000; ++i)
if(ind[i]==i)
{
for(j=i; j<=100000; j+=i)
ind[j]=ind[j]/i*(i-1);
}
while(n--)
{
fin>>x;
fout<<1LL*x*ind[x]*2<<'\n';
}
}