Cod sursa(job #1194699)
Utilizator | Data | 4 iunie 2014 17:27:03 | |
---|---|---|---|
Problema | Sum | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <cstdio>
using namespace std;
long long phi[100005];
int main()
{int n,i,j,t,x;
freopen("sum.in","r",stdin);
scanf("%d",&t);
freopen("sum.out","w",stdout);
for(i=2;i<=100005;++i)
phi[i]=i-1;
for(i=2;i<=50005;++i)
for(j=2*i;j<=100005;j+=i)
phi[j]-=phi[i];
while(t--)
{
scanf("%d",&x);
printf("%lld\n",(2LL*x*phi[x]));
}
return 0;
}