题解 | 小红走网格

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

int gcd(int a,int b){
    if(b==0){
        return a;
    }
    return gcd(b,a%b);
}
int lcm(int a,int b){
    return (a*b)/gcd(a,b);
}
//（贝祖定理）
//ad=right*X-left*Y   xy有整数解  需要最大公约数(right,left)能整除ad
int main() {
   int T;
   cin>>T;
   while(T--){
       int ad,ws,up,down,left,right;
       cin>>ad>>ws>>up>>down>>left>>right;
       bool adflag=0,wsflag=0;
      if(ad%gcd(right,left)==0){
          adflag=1;
      }
      if(ws%gcd(up,down)==0){
        wsflag=1;
      }
       if(wsflag==1&&adflag==1){
    cout<<"YES"<<endl;
      }
      else{
        cout<<"NO"<<endl;
      }
   }
  
}
// 64 位输出请用 printf("%lld")