题解 | 小红与gcd三角形

#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using PII=pair<ll,ll>;
using PIII=pair<int,pair<int,int>>;
const ld ESP = 1e-10;
const ld PI = acosl(-1);
const int N=1e6+10;
const int M=2e5+10;
// const int mod = 1000000007;
const int mod = 998244353;
//随机化
random_device rd;
mt19937 gen(rd());
uniform_int_distribution<> dis(1, 1000000000);

void solve(){
    int x,y;
    cin>>x>>y;
    int d=gcd(x,y);
    vector<int> a;
    a.push_back(x);
    a.push_back(y);
    a.push_back(d);
    sort(a.begin(),a.end());
    if(a[0]+a[1]>a[2]){
        cout<<"Yes"<<'\n';
    }else{
        cout<<"No"<<'\n';
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int _=1;
    cin>>_;
    while(_--){
        solve();
    }
    return 0;
}