题解 | 小红与gcd三角形

#include <iostream>
#include<algorithm>
#include<cmath>
using namespace std;

int gcd(int a, int b) {
    a = abs(a);
    b = abs(b);
    while (b != 0) {
        int temp = b;
        b = a % b;
        a = temp;
    }
    return a;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin>>t;
    while(t--){
        int a,b;
        cin>>a>>b;
        int c=gcd(a,b);
        if(a+b+c-max(a,max(b,c))>max(a,max(b,c)))cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
}
// 64 位输出请用 printf("%lld")