Pagini recente » Cod sursa (job #2823556) | Cod sursa (job #2170298) | Cod sursa (job #2175520) | Cod sursa (job #2961961) | Cod sursa (job #1875690)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("sum.in");
ofstream out("sum.out");
int n,maxx;
long long euler[100001];
int v[100001];
int main()
{
in>>n;
for(int i = 1; i<=n; i++)
{
in>>v[i];
maxx=max(maxx,v[i]);
}
for(int i = 1;i<=maxx;i++)
euler[i]=i;
for(int i = 2; i<=maxx; i++)
{
if(euler[i]==i)
{
for(int j = i; j<=maxx; j+=i)
{
euler[j]/=i;
euler[j]*=(i-1);
}
}
}
for(int i = 1; i<=n; i++)
{
out<<v[i]*2*euler[v[i]]<<'\n';
}
return 0;
}