Pagini recente » Diferente pentru problema/simulare intre reviziile 32 si 35 | Cod sursa (job #104837) | Cod sursa (job #556314) | Cod sursa (job #688210) | Cod sursa (job #1576547)
#include <cstdio>
using namespace std;
long long int p[100005],x,n,j,i;
int main()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
for(i=1;i<=100000;i++){p[i]=i-1;}
for(i=2;i<=100000;i++){for(j=2*i;j<=100000;j+=i){p[j]-=p[i];}}
scanf("%d",&n);
for(i=1;i<=n;i++){scanf("%d",&x);printf("%lld\n",2*x*p[x]);}
return 0;
}