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