Pagini recente » Cod sursa (job #294527) | Cod sursa (job #1510692) | Cod sursa (job #1440085) | Cod sursa (job #929372) | Cod sursa (job #1712729)
#include <iostream>
#include <fstream>
using namespace std;
long int n;
long long int i,j;
long int inf = 10000;
long int totient[10001];
int main()
{
ifstream f("sum.in");
ofstream g("sum.out");
f >> n;
for (i=1;i<=inf;i++)
totient[i]=i;
for (i=2;i<=inf;i++)
if (totient[i]==i)
{
for (j=i;j<=inf;j+=i)
totient[j] /=i, totient[j] *= (i-1);
}
for(i = 0; i < n; i++)
{
long int x;
f >> x;
g << 2*x*totient[x] << '\n';
}
return 0;
}