hdoj1222Wolf and Rabbit

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

21 22 2

 

Sample Output

NOYES

 

Author

weigang Lee

此题主要需要求两个数的最大公约数，如果最大公约数为1，则不存在安全洞，否则存在。如果最大公约数为1的话，则狼会按逆时针方向遍历每个山洞，因而安全洞不存在。

代码如下：