Pagini recente » Cod sursa (job #2044661) | Cod sursa (job #2998966) | Cod sursa (job #1258741) | Cod sursa (job #332633) | Cod sursa (job #2154676)
#include <fstream>
#define ll long long
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
int n,i,maxim,j,a,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<<(ll)(2*a*euler[a])<<'\n';
}
return 0;
}