Cod sursa(job #1733502)
| Utilizator | Data | 24 iulie 2016 19:49:45 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#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;
cin >> T;
while (T--) {
cin >> A >> B;
cout << Euclid::SolveGCD(A,B) << endl;
}
return 0;
}
