RE 9个点 为什么，大佬请进

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstring>
using namespace std;
long long t;
long long d;
long long gcd(long long a,long long b)
{
	if(b==0)
	return a;
	return gcd(b,b%a);
}
bool check(long long x,long long y)
{
	if(x%d==0&&y%d==0)
	return true;
	return false;
}
int main(){
	scanf("%lld",&t);
	long long a,b,x,y;
	while(t--){
	scanf("%lld%lld%lld%lld",&a,&b,&x,&y);
	d=gcd(a,b)*2;
	if(check(x,y)||check(x+a,y+b)||check(x+b,y+a)||check(x+a+b,y+a+b))
	{
		cout<<"Y"<<endl;
		continue;
	}
	else
	{
		cout<<"N"<<endl;
	}
}
	return 0;
}