Cod sursa(job #1822370)
Utilizator | Ionut Balauca faceless | Data | 4 decembrie 2016 19:52:03 |
---|---|---|---|
Problema | Sum | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <bits/stdc++.h>
#define nmax 100001
using namespace std;
ifstream fin("sum.in");
ofstream fout("sum.out");
long long phi[nmax];
int main()
{
int x,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];
}
}
fin>>t;
for(int i=1;i<=t;i++)
{
fin>>n;
fout<<1LL*2*n*phi[n]<<'\n';
}
return 0;
}