Pagini recente » Cod sursa (job #2613565) | Cod sursa (job #1732137) | Cod sursa (job #1666597) | Cod sursa (job #2252528) | Cod sursa (job #2632841)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n, x, y;
/*int cmmdc(int a, int b)
{
while(b!=0)
{
int r=a%b;
a=b;
b=r;
}
return a;
}*///trebuie recursiv
int cmmdc(int a, int b)
{
if(b==0)
return a;
else
return cmmdc(b,a%b);
}
int main()
{
f>>n;
for(int i=1; i<=n; i++)
{
f>>x>>y;
g<<cmmdc(x,y)<<endl;
}
return 0;
}