Pagini recente » Cod sursa (job #2750225) | Cod sursa (job #687317) | Cod sursa (job #507441) | Cod sursa (job #345911) | Cod sursa (job #525226)
Cod sursa(job #525226)
#include <fstream.h>
ifstream f("sum.in");
ofstream g("sum.out");
long long max=100005;
int main(){
long long phi[1000009];
long long i,j,x,n,z;
f>>n;
for (int i = 1; i <= max; ++i)
phi[i] = i-1;
for (int i = 2; i <= max; ++i)
for (int j = i+i; j <= max; j += i)
phi[j] -= phi[i];
for(i=1;i<=n;i++){
f>>x;
z=phi[x];
g<<2*z*x<<endl;
}
return 0;
}