Cod sursa(job #2919101)
Utilizator | Data | 15 august 2022 17:31:41 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
int gcd(int a, int b)
{
if (a < b)
std::swap(a, b);
while (b)
{
int r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
int t, a, b;
std::cin >> t;
while (t--)
{
std::cin >> a >> b;
std::cout << gcd(a, b) << '\n';
}
return 0;
}