Pagini recente » Cod sursa (job #2182473) | Cod sursa (job #2909834) | Cod sursa (job #693269) | Cod sursa (job #2889006) | Cod sursa (job #2782670)
#include <fstream>
using namespace std;
ifstream fin( "sum.in" );
ofstream fout( "sum.out" );
const int N_MAX = 100000;
int phi[N_MAX + 1];
inline void calcul_phi() {
for ( int i = 2; i <= N_MAX; i++ )
phi[i] = i;
for ( int i = 2; i <= N_MAX; i++ )
if ( phi[i] == i )
for ( int j = i; j <= N_MAX; j += i )
phi[j] = phi[j] / i * (i - 1);
}
int main(){
int t, n;
calcul_phi ();
for ( fin >> t; t; t-- ) {
fin >> n;
fout << (long long) 2 * phi[n] * n << '\n';
}
return 0;
}