Pagini recente » Cod sursa (job #213444) | Cod sursa (job #2691454) | Cod sursa (job #1111405) | Cod sursa (job #1291913) | Cod sursa (job #2780828)
#include <fstream>
using namespace std;
ifstream in("sum.in");
ofstream out("sum.out");
const int maxN=100000;
int e[maxN+1];
void euler()
{
for(int i=2;i<=maxN;i++)
e[i]=i;
for(int i=2;i<=maxN;i++)
if(e[i]==i)
for(int j=i;j<=maxN;j+=i)
e[j]=e[j]/i*(i-1);
}
int main()
{
ios::sync_with_stdio(false);
in.tie(0);
out.tie(0);
euler();
int n;
in>>n;
while(n--)
{
int x;
in>>x;
out<<e[x]*x*2*1LL<<'\n';
}
in.close();
out.close();
return 0;
}