Cod sursa(job #2403707)
Utilizator | Data | 11 aprilie 2019 19:48:55 | |
---|---|---|---|
Problema | Sum | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("sum.in");
ofstream fout("sum.out");
#define XMax 100001
#define ll long long
int n, x;
int phi[XMax];
int main(){
int i, j;
for(i = 1; i < XMax; i++) phi[i] = i - 1;
for(i = 1; i < XMax; i++)
for(j = i + i; j < XMax; j += i)
phi[j] -= phi[i];
fin >> n;
while(n--){
fin >> x;
fout << 1ll * x * phi[x] * 2 << '\n';
}
}