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