Pagini recente » Cod sursa (job #2468581) | Cod sursa (job #339000) | Cod sursa (job #194896) | Cod sursa (job #601109) | Cod sursa (job #1940309)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
void gcd(int dividend, int divisor) {
if (!divisor)
g << dividend<<endl;
else
gcd(divisor, (dividend%divisor));
}
int main()
{
int t;
int a, b;
f >> t;
for (int i = 0; i < t; i++)
{
f >> a;
f >> b;
if (a > b)
gcd(a, b);
else
gcd(b, a);
}
f.close();
g.close();
return 0;
}