bzoj2299 [HAOI2011]向量

#include<bits/stdc++.h>
using namespace std;
long long T,a,b,x,y,d;
inline char nc()
{
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline long long read()
{
long long x=0,b=1;
char c=nc();
for(;!(c<='9'&&c>='0');c=nc())if(c=='-')b=-1;
for(;c<='9'&&c>='0';c=nc())x=x*10+c-'0';
return x*b;
}
inline void write(int x)
{
if(x==0)putchar('0');
else
{
char buf[15];
int len=0;
if(x<0)putchar('-'),x=-x;
while(x)buf[++len]=x%10+'0',x/=10;
for(int i=len;i>=1;i--)putchar(buf[i]);
}
putchar(' ');
}
inline long long gcd(long long x,long long y)
{
return y==0?x:gcd(y,x%y);
}
inline bool jug(long long x,long long y)
{
return (x%d==0&&y%d==0);
}
int main()
{
freopen("in.txt","r",stdin);
T=read();
while(T--)
{
a=read(),b=read(),x=read(),y=read();
d=gcd(a,b)*2;
if(jug(x,y)||jug(x+a,y+b)||jug(x+b,y+a)||jug(x+a+b,y+a+b))puts("Y");
else puts("N");
}
return 0;
}