Pagini recente » Cod sursa (job #609919) | Cod sursa (job #2000791) | Cod sursa (job #1151372) | Cod sursa (job #876585) | Cod sursa (job #1874151)
# include <fstream>
using namespace std;
const int MAX_N = 100000;
int phi[1 + MAX_N];
int main() {
ifstream fin( "sum.in" );
ofstream fout( "sum.out" );
for ( int i = 2; i <= MAX_N; i ++ )
phi[i] = i;
for ( int i = 2; i <= MAX_N; i ++ )
if ( phi[i] == i )
for ( int j = i; j <= MAX_N; j += i )
phi[j] -= phi[j] / i;
int n;
fin >> n;
for ( int i = 0; i < n; i ++ ) {
int x;
fin >> x;
fout << ( long long ) phi[x] * x * 2 << '\n';
}
fin.close();
fout.close();
return 0;
}