题解 | 小红与gcd三角形

#include <iostream>
#include<algorithm>
using namespace std;
int gcd(int n,int m){
    while(m>0){
        int t=m;
        m=n%m;
        n=t;
    }
    return n;
}
int main() {
    int t;
    cin>>t;
    while(t--){
        int x,y;
        cin>>x>>y;
        int g=gcd(x,y);
        int a=min({x,y,g});
        int c=max({x,y,g});
        int b=x+y+g-a-c;
        if(a+b>c)cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
    return 0;
}
// 64 位输出请用 printf("%lld")