我好像老是忘记最大公约数的算法,再次特地再打一遍!
#include<iostream>
#define LL long long
using namespace std;
LL gcd(LL a, LL b) {
return (a == 0) ? b : gcd(b%a, a);
}
int main()
{
int T;
cin >> T;
LL m, n;
while (T--) {
cin >> m >> n;
if (gcd(m, n) == 1)
cout << "NO";
else cout << "YES";
cout << endl;
}
return 0;
}