Pagini recente » Rating ionescu ionut (ionut_medd) | Cod sursa (job #583491) | Cod sursa (job #1596936) | Cod sursa (job #1276442) | Cod sursa (job #1593136)
#include <fstream>
using namespace std;
ifstream fi("sum.in");
ofstream fo("sum.out");
const int Dim=100000;
long long phi[Dim+1],n,x;
void generare_phi()
{
for (int i=1;i<=Dim;i++)phi[i]=i-1;
for (int i=2;i<=Dim;i++)
for (int j=2*i;j<=Dim;j+=i) phi[j]-=phi[i];
}
int main()
{
generare_phi();
fi>>n;
for(int i=1;i<=n;i++)
{ fi>>x;
fo<<2*phi[x]*x<<'\n';}
return 0;
}