# Wolf and Rabbit

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5929    Accepted Submission(s): 2977

Problem Description
There is a hill with n holes around. The holes are signed from 0 to n-1.

A rabbit must hide in one of the holes. A wolf searches the rabbit in anticlockwise order. The first hole he get into is the one signed with 0. Then he will get into the hole every m holes. For example, m=2 and n=6, the wolf will get into the holes which are signed 0,2,4,0. If the rabbit hides in the hole which signed 1,3 or 5, she will survive. So we call these holes the safe holes.

Input
The input starts with a positive integer P which indicates the number of test cases. Then on the following P lines,each line consists 2 positive integer m and n(0<m,n<2147483648).

Output
For each input m n, if safe holes exist, you should output "YES", else output "NO" in a single line.

Sample Input
2 1 2 2 2

Sample Output
NO YES

Author
weigang Lee

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int exGcd(int a,int b,int &x,int &y)
{
if(b==0)
{
x=1;
y=0;
return a;// 此时a是最开始（a,b）的最大公约数，那么  gcd（a,b）*1+ 0*0=gcd(a,b),肯定对的，在这里，我认为，y可以为任何值都对
}

int d=exGcd(b,a%b,y,x);
y-=a/b*x;
return d;//返回最大公约数
}
int main()
{
int n,m,t,x,y;
cin>>t;
while(t--)
{
cin>>n>>m;
if(exGcd(n,m,x,y)==1)
{
cout<<"NO"<<endl;
}
else
{
cout<<"YES"<<endl;
}
}
}


11-15 1740

07-23 97

08-04 223

07-24 165

09-11 89

01-29 103

02-10 472

08-19 258

05-14 708

07-20 217