Pagini recente » Borderou de evaluare (job #804984) | Cod sursa (job #2372460) | Cod sursa (job #2508920) | Cod sursa (job #2315603) | Cod sursa (job #775389)
Cod sursa(job #775389)
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
#define nmax 100000
int phi[100010], T, X;
int main()
{
freopen("sum.in", "r", stdin);
freopen("sum.out", "w", stdout);
int i, j;
for(i = 1; i <= nmax; i++) phi[i] = i;
for(i = 2; i <= nmax; i++)
if(phi[i] == i)
for(j = i; j <= nmax; j += i) phi[j] /= i, phi[j] *= (i - 1);
scanf("%i", &T);
while(T --)
{
scanf("%i", &X);
printf("%i\n", 2 * X * phi[X]);
}
scanf("%i", &i);
return 0;
}