Cod sursa(job #3258688)
| Utilizator | Data | 23 noiembrie 2024 12:51:00 | |
|---|---|---|---|
| Problema | Sum | Scor | 45 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("sum.in");
ofstream fout("sum.out");
int phi(int n) {
int tot[n+1];
for (int i=1; i<=n; i++) {
tot[i] = i;
}
for (int i=2; i<=n; i++) {
if (tot[i] == i) {
tot[i] -= 1; // phi(i) = i-1 daca i prim
for (int j=2; i*j <= n; j++) {
tot[i*j] = tot[i*j]/i * (i-1);
}
}
}
return tot[n];
}
int main()
{
int n; fin >> n;
for (int i=0; i<n; i++) {
int x; fin >> x;
fout << 2*x*phi(x) << endl;
}
return 0;
}
