Cod sursa(job #3156058)
| Utilizator | Data | 10 octombrie 2023 15:08:37 | |
|---|---|---|---|
| Problema | Sum | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
#define N 100005
ifstream fin("sum.in");
ofstream fout("sum.out");
long long phi[N];
int main()
{
int n, nr;
fin >> n;
phi[1] = 1;
for (int i = 2; i <= 100000; i++)
phi[i] = i - 1;
for (int i = 2; i <= 100000; i++)
for (int j = 2 * i; j <= 100000; j += i)
phi[j] -= phi[i];
for (int i = 1; i <= n; i++)
{
fin >> nr;
fout << 2LL * nr * phi[nr] << '\n';
}
return 0;
}
