Pagini recente » Cod sursa (job #1997518) | winners32 | Cod sursa (job #2563385) | Cod sursa (job #297780) | Cod sursa (job #2299730)
#include <iostream>
#include <fstream>
#define NUM 100005
int phi[NUM];
int n;
long long val;
using namespace std;
int main()
{
///*
ifstream f("sum.in");
ofstream g("sum.out");
//*/
/*
ifstream f("fractii.in");
ofstream g("fractii.out");
//*/
for(int i = 1; i < NUM; ++i)
phi[i] = i;
for(int i = 2; i < NUM; ++i)
if(phi[i] == i)
for(int j = i; j < NUM; j += i)
{
// phi[j] = phi[j] * (1 - 1 / i)
phi[j] /= i;
phi[j] *= (i - 1);
}
f >> n;
for(int i = 1; i <= n; ++i)
{
f >> val;
g << val * phi[val] * 2 << "\n";
}
f.close();
g.close();
return 0;
}