51Nod--1247 可能的路径（gcd）

#include<bits/stdc++.h>
using namespace std;
#define maxn 50005
#define LL long long
//LL  a[maxn],b[maxn],ans=0;
priority_queue<int,vector<int>,greater<int> >q;
LL gcd(LL a,LL b){
   return b==0? a:gcd(b,a%b);
}
int main(){
  int t;
  cin>>t;
  while(t--){
     LL x,y,xx,yy;
     cin>>x>>y>>xx>>yy;
     if(gcd(x,y)==gcd(xx,yy)){
        cout<<"Yes"<<endl;
     }else{
        cout<<"No"<<endl;
     }
  }
  return 0;
}