Pagini recente » Cod sursa (job #3173145) | Cod sursa (job #2497503) | Cod sursa (job #909764) | Cod sursa (job #1199063) | Cod sursa (job #2299728)
#include <iostream>
#include <fstream>
#define NUM 100005
int phi[NUM];
int n, val;
long long sum;
using namespace std;
int main()
{
///*
ifstream f("sum.in");
ofstream g("sum.out");
//*/
/*
ifstream f("fractii.in");
ofstream g("fractii.out");
//*/
for(int i = 2; 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];
f >> n;
for(int i = 1; i <= n; ++i)
{
f >> val;
g << 2 * val * phi[val] << "\n";
}
f.close();
g.close();
return 0;
}