Pagini recente » Cod sursa (job #2150494) | Cod sursa (job #2854939) | Cod sursa (job #358041) | Cod sursa (job #197863) | Cod sursa (job #1202644)
#include<fstream>
using namespace std;
int main()
{
ifstream f("sum.in");
ofstream g("sum.out");
long i,j,n,x,totient[10000];
for(i=1;i<=10001;++i) totient[i]=i;
for(i=2;i<=10001;++i)
if(totient[i]==i)
{
for(j=i;j<=10001;j=j+i)
totient[j]=totient[j]-totient[j]/i;
}
f>>n;
for(i=1;i<=n;++i)
{
f>>x;
g<<2*x*totient[x]<<"\n";
}
f.close();
g.close();
return 0;
}