Pagini recente » Cod sursa (job #2161858) | Cod sursa (job #1302538) | Cod sursa (job #261393) | Cod sursa (job #1893539) | Cod sursa (job #1910416)
#include <fstream>
using namespace std;
ifstream in("sum.in");
ofstream out("sum.out");
long long phi[1000001];
int v[1000001];
int main()
{
int n,i,j,lim=0;
long long r=0;
in>>n;
for(i=1;i<=n;i++)
{
in>>v[i];
if(v[i]>lim)
lim=v[i];
}
for(i=1;i<=lim;i++)
phi[i]=i;
for(i=2;i<=lim;i++)
if(phi[i]==i)
for(j=i;j<=lim;j+=i)
{
phi[j]/=i;
phi[j]*=(i-1);
}
for(i=1;i<=n;i++)
{
r=v[i]*2*phi[v[i]];
out<<r<<'\n';
}
return 0;
}