Cod sursa(job #1822385)
Utilizator | Data | 4 decembrie 2016 20:08:26 | |
---|---|---|---|
Problema | Sum | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <bits/stdc++.h>
#define nmax 100001
using namespace std;
long long phi[nmax];
int main()
{ freopen("sum.in", "r", stdin);
freopen("sum.out", "w", stdout);
int n,t;
for(int i=1;i<=nmax;i++)
phi[i]=i-1;
for(int i=2;i<=nmax;i++)
{
for(int j=2*i;j<=nmax;j+=i)
{
phi[j]=phi[j]-phi[i];
}
}
scanf("%d",&t);
for(int i=1;i<=t;i++)
{
scanf("%d",&n);
printf("%lld\n",1LL*2*n*phi[n]);
}
return 0;
}