Cod sursa(job #1815705)
Utilizator | Rotileanu Alexandru Firealex2 | Data | 25 noiembrie 2016 18:06:00 |
---|---|---|---|
Problema | Sum | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fi("sum.in");
ofstream fo("sum.out");
const int maxn = 100000;
long long int phi[maxn + 1];
int N;
void indicator()
{
for (int i = 1;i <= maxn;i++)
phi[i] = i - 1;
for (int i = 2;i <= maxn;i++)
if (phi[i] == i - 1)
{
for (int j = 2 * i;j <= maxn;j += i)
phi[j] -= phi[i];
}
return;
}
int main()
{
fi >> N;
indicator();
for (int i = 1;i <= N;i++)
{
int nr;
fi >> nr;
fo << 2 * nr*phi[nr] << '\n';
}
return 0;
}