Pagini recente » Cod sursa (job #1722900) | Cod sursa (job #196557) | Cod sursa (job #687851) | Cod sursa (job #1320154) | Cod sursa (job #2154665)
#include <fstream>
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
int n,i,maxim,j,a;
long long euler[100002];
int main()
{
f>>n;
for (int i=2; i<=100002; i++)
euler[i]=i-1;
for (int i=2; i<=100002; i++)
{
//sol+=euler[i];
for (int j=i<<1; j<=100002; j+=i)
euler[j]-=euler[i];
}
for(i=1; i<=n; i++)
{
f>>a;
g<<2*a*euler[a]<<'\n';
}
return 0;
}