Cod sursa(job #1150242)
Utilizator | Radu Cebotari radu_cebotari | Data | 22 martie 2014 18:40:07 |
---|---|---|---|
Problema | Sum | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.56 kb |
#include<fstream>
#include<iostream>
using namespace std;
long long phi[1000000],sum[1000000];
inline void solve()
{
long long i,j;
for ( i=1; i<=100001; i++)
phi[i]=i;
for (i=2;i<=100001;i++)
if (phi[i]==i)
for (j=i;j<=100001;j+=i) phi[j] /=i, phi[j] *= (i-1);
}
int main()
{
ifstream in("sum.in");
ofstream out("sum.out");
long long T,n;
in>>T;
solve();
for(; T ; --T )
{
in>>n;
out<<2*n*phi[n]<<"\n";
}
in.close();
out.close();
return 0;
}