Pagini recente » Cod sursa (job #2208963) | Cod sursa (job #2648147) | Cod sursa (job #2682787) | Cod sursa (job #1973868) | Cod sursa (job #1733503)
#include <iostream>
#include <cstdio>
using namespace std;
class Euclid{
public:
static long long SolveGCD(long long first_number,
long long second_number) {
if (second_number == 0) {
return first_number;
}
return Euclid::SolveGCD(second_number,
first_number % second_number);
}
};
int main() {
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
// Testing...
int T,A,B;
scanf("%d", &T);
while (T--) {
scanf("%d %d", &A, &B);
printf("%lld\n", Euclid::SolveGCD(A,B));
}
return 0;
}