Pagini recente » Cod sursa (job #2675877) | Cod sursa (job #1488982) | Cod sursa (job #1309068) | Atasamentele paginii Ciclu hamiltonian de cost minim | Cod sursa (job #1216413)
#include <fstream>
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
long long phi[10005];
int main()
{ long long n, x;
for (long long i=1; i <=10000; ++i)
phi[i] = i-1;
for (long i = 2; i <=10000; ++i)
for (long j = 2*i; j <=10000; j += i)
phi[j] -= phi[i];
f>>n;
while (n--) {f>>x;
g << 2*x*phi[x] << "\n";
}
return 0;
}