Cod sursa(job #2959743)
Utilizator | Data | 2 ianuarie 2023 16:10:36 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.3 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, n;
cin >> n;
while (n--) {
cin >> a >> b;
cout << gcd(a, b);
}
return 0;
}