这题就是在考察Ax+By=C,要想有整数解,C一定得是gcd(x,y)的倍数这个知识点

搞明白这个就简单了



import java.math.BigInteger;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
//		Ax+By=C,要想有整数解,C一定得是gcd(x,y)的倍数
		Scanner scanner=new Scanner(System.in);
		int t=scanner.nextInt();
		while(t-->0) {
			int x=scanner.nextInt();
			int y=scanner.nextInt();
			int a=scanner.nextInt();
			int b=scanner.nextInt();
			int c=scanner.nextInt();
			int d=scanner.nextInt();
//			x c d   ||  y a b
			int gcdx=gcd(c,d);
			int gcdy=gcd(a,b);
			if(x%gcdx==0&&y%gcdy==0) {
				System.out.println("YES");
			}else {
				System.out.println("NO");
			}
			
		}

	}
	public static int gcd(int a,int b) {
		BigInteger aBigInteger=new BigInteger(a+"");
		BigInteger bBigInteger=new BigInteger(""+b);
		return Integer.parseInt(aBigInteger.gcd(bBigInteger).toString());
	}

}