最大公约数 gcd算法
https://www.acwing.com/problem/content/874/
(lcm求最小公倍数 https://www.nowcoder.com/practice/22948c2cad484e0291350abad86136c3?tpId=37&tqId=21331&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=%2Fexam%2Foj%2Fta%3FtpId%3D37&difficulty=undefined&judgeStatus=undefined&tags=&title=)
code
#include<iostream>
using namespace std;
int n;
int gcd(int a, int b)
{
if(a < b) return gcd(b, a);
return a % b == 0 ? b : gcd(b, a % b);
}
int lcm(int a, int b)
{
return a * b / gcd(a, b);
}
int main()
{
cin >> n;
while(n --){
int a, b;
cin >> a >> b;
cout << gcd(a, b) << endl;
}
}