Pagini recente » Cod sursa (job #1854610) | Cod sursa (job #1793160) | Cod sursa (job #3271461) | Cod sursa (job #2438443) | Cod sursa (job #2096723)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
int n, phi[100001];
void indiceleLuiEuler(){
for(int i=1; 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];
}
void sum(int n){
long long k;
for(int i=1; i<=n; i++){
f>>k;
g<<2*k*phi[k]<<"\n";
}
}
int main()
{
f>>n;
indiceleLuiEuler();
sum(n);
return 0;
}