Pagini recente » Cod sursa (job #1415097) | Cod sursa (job #1546379) | Cod sursa (job #2230435) | Cod sursa (job #1537329) | Cod sursa (job #2268074)
#include <iostream>
#include <stdio.h>
long long e[100001];
int main() {
FILE *fin, *fout;
long long n, i, x, j, M;
fin = fopen( "sum.in", "r" );
fout = fopen( "sum.out", "w" );
fscanf( fin, "%d", &n );
M = 100000;
for( i = 2; i <= M; i++ ) {
e[i] = i;
}
for( i = 2; i <= M; i++ ) {
if( e[i] == i ) {
for( j = i; j <= M; j += i ) {
e[j] = e[j] / i * (i - 1);
}
}
}
for( i = 1; i <= n; i++ ) {
fscanf( fin, "%d", x );
fprintf( fout, "%lld\n", e[x] * x * 2 );
}
fclose( fin );
fclose( fout );
return 0;
}