Cod sursa(job #1473670)
Utilizator | Data | 19 august 2015 23:01:36 | |
---|---|---|---|
Problema | Sum | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include<cstdio>
#define MAX 100005
using namespace std;
int N, T, i, j;
int phi[MAX];
int main()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
scanf("%d", &T);
for (i = 1; i <= MAX; i++) phi[i]=i;
for (i = 2; i <= MAX; i++)
if (phi[i] == i)
for (j = i; j <= MAX; j += i)
phi[j] /=i, phi[j] *= (i-1);
for ( ; T; T--)
{
scanf("%d", &N);
printf("%lld\n", 1LL * N * phi[N] * 2);
}
}