Pagini recente » Cod sursa (job #917418) | Cod sursa (job #27129) | monthly-2014/runda-5/solutii | Cod sursa (job #2010899) | Cod sursa (job #1051585)
#include <iostream>
#include <fstream>
using namespace std;
int euclid(int a, int b)
{
while(a!=b)
if(a>b) a=a-b;
else b=b-a;
return b;
}
int main()
{
ifstream f ("sum.in");
ofstream g ("sum.out");
unsigned long n,i,x,s=0,j;
f>>n;
for(i=0;i<n;i++)
{
f>>x;
for(j=1;j<2*x;j++)
if(euclid(x,j)==1) s=s+j;
g<<s<<'\n';
s=0;
}
g.close();
f.close();
return 0;
}