Cod sursa(job #1876547)
| Utilizator | Data | 12 februarie 2017 14:16:44 | |
|---|---|---|---|
| Problema | Sum | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream in ("sum.in");
ofstream out ("sum.out");
long long phi[100001];
int main()
{
long long n,i,j,x,lim=100000;
in>>n;
for (i=1;i<=lim;i++)
phi[i]=i;
for (i=2;i<=lim;i++)
if (phi[i]==i)
for (j=i;j<=lim;j+=i)
{
phi[j]*=i-1;
phi[j]/=i;
}
/*for (i=1;i<=lim;i++)
out<<phi[i]<<" ";
out<<'\n';*/
for (i=1;i<=n;i++)
{
in>>x;
out<<x*phi[x]*2<<'\n';
}
return 0;
}
