Cod sursa(job #3149126)
Utilizator | Ioana Prunaru oana75 | Data | 6 septembrie 2023 15:26:18 |
---|---|---|---|
Problema | Sum | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
using namespace std;
const int NMAX = 100000;
ifstream in("sum.in");
ofstream out("sum.out");
int Phi[NMAX + 1];
void Euler(int n)
{
for(int i = 1; i <= n; i++)
Phi[i] = i;
for(int i = 2; i <= n; i++)
if(Phi[i] == i)
for(int j = i; j <= n; j += i)
Phi[j] -= Phi[j] / i;
}
int main()
{
int n, T;
in >> T;
Euler(NMAX);
while(T--)
{
in >> n;
out << 2LL * Phi[n] * n << '\n';
}
in.close();
out.close();
}