Cod sursa(job #1150247)
Utilizator | Radu Cebotari radu_cebotari | Data | 22 martie 2014 18:47:56 |
---|---|---|---|
Problema | Sum | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include<cstdio>
using namespace std;
#define DMAX 100001
long long phi[1000000],sum[1000000];
inline void solve()
{
long long i,j;
for( i = 1 ; i <= DMAX ; i++)
phi[i] = i-1;
for( i = 2 ; i <= DMAX ; i++)
for(j = 2*i ; j<=DMAX ; j+=i)
phi[j] -= phi[i];
}
int main()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
long long T,n;
scanf("%d",&T);
solve();
for(; T ; --T )
{
scanf("%d",&n);
printf("%lld\n",(2LL*n*phi[n]));
}
return 0;
}