Cod sursa(job #2529553)
Utilizator | Data | 23 ianuarie 2020 17:28:48 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <iostream>
using namespace std;
int gcd(int a, int b) {
if(!b)
return a;
return gcd(b, a % b);
}
int main() {
int a, b, T;
cin >> T;
for(int t = 0; t < T; ++t) {
cin >> a >> b;
cout << gcd(a, b);
}
}