Pagini recente » Cod sursa (job #2031310) | Cod sursa (job #41396) | Cod sursa (job #1544093) | Cod sursa (job #2554496) | Cod sursa (job #1216423)
#include <fstream>
#include <stdio.h>
#define max 100001
using namespace std;
long long phi[max];
int n, x;
int main()
{
ifstream f("sum.in");
freopen("sum.out", "w", stdout);
for (int i=1; i <=max; ++i)
phi[i] = i-1;
for (int i = 2; i <=max; ++i)
for (int j = 2*i; j <=max; j += i)
phi[j] -= phi[i];
f>>n;
while (n--) {
f>>x;
long long s; s=2*x*phi[x];
printf("%lld\n",s);
}
return 0;
}