Cod sursa(job #2023001)
| Utilizator | Data | 17 septembrie 2017 22:07:53 | |
|---|---|---|---|
| Problema | Sum | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin("sum.in");
ofstream fout("sum.out");
int phi[100005];
long long n, x;
int main()
{
fin >> n;
for(int i=1; i<=100000; i++)
phi[i] = i;
for(int i=2; i<=100000; i++)
if(phi[i]==i)
for(int j=i; j<=100000; j+=i)
phi[j] = phi[j]/i*(i-1);
for(int i=1; i<=n; i++)
{
fin >> x;
fout << 2*x*phi[x] << "\n";
}
fin.close();
fout.close();
return 0;
}
