Cod sursa(job #1493247)
| Utilizator | Data | 28 septembrie 2015 21:42:50 | |
|---|---|---|---|
| Problema | Sum | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream in("sum.in");
ofstream out("sum.out");
long long n,phi[100000];
void ciur()
{
long long i,j;
for(i=1;i<=100000;i++)
phi[i]=i;
for(i=2;i<=100000;i++)
if(phi[i]==i)
for (j=i; j<=100000; j+=i)
{phi[j]/=i;
phi[j]*=(i-1);}}
int main()
{long long t,x,solutie;
in>>t;
ciur();
for(long i=1;i<=t;++i)
{in>>x;
solutie=2*phi[x]*x;
out<<solutie<<'\n';}
return 0;
}
