题解 | 小红走网格

#include <iostream>
using namespace std;

int gcd(int a, int b){
    return b==0? a : gcd(b, a%b);
}

void solve(){
    int x, y, a, b, c, d;
    cin >> x >> y >> a >> b >> c >> d;
    int g_x = gcd(c, d);
    int g_y = gcd(a, b);

    if(x % g_x == 0 && y % g_y == 0){
        cout << "YES" << endl;
    }else{
        cout << "NO" << endl;
    }
}


int main() {
    int T;
    cin >> T;
    while(T--){
        solve();
    }


    return 0;
}
// 64 位输出请用 printf("%lld")