Pagini recente » Cod sursa (job #2174660) | Cod sursa (job #59924) | Cod sursa (job #410301) | Cod sursa (job #2096731)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
int n, k, phi[100001];
void indiceleLuiEuler(){
for(int i=1; i<=100000; i++)
phi[i]=i-1;
for(int i=2; i<=100000; i++)
for(int j=2*i; j<=100000; j+=i)
phi[j]-=phi[i];
}
void sum(){
f>>n;
while(n--){
f>>k;
g<<(long long)2*k*phi[k]<<"\n";
}
}
int main()
{
indiceleLuiEuler();
sum();
return 0;
}