Pagini recente » Cod sursa (job #196859) | Cod sursa (job #586616) | Cod sursa (job #859149) | Cod sursa (job #2156771) | Cod sursa (job #1207172)
#include <cstdio>
using namespace std;
#define NMAX 200000
long long phi[NMAX];
int Q,i,j,X;
void build_phi()
{
int i,j;
for (i=2;i<NMAX;++i)
phi[i]=i-1;
for (i=2;i<NMAX;++i)
for (j=2*i;j<NMAX;j+=i)
phi[j]-=phi[i];
for (i=2;i<NMAX;++i)
phi[i]*=1LL*2*i;
}
int main()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
scanf("%d",&Q);
build_phi();
while (Q--)
{
scanf("%d",&X);
printf("%lld\n",phi[X]);
}
return 0;
}