HDU - 1222 Wolf and Rabbit

HDU 1222 wolf and

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

ps:这道题先找一个例子找规律：比如 用一个用8个洞口的山，会发现n=1,3,5,7是不会有生存的可能的，而n=2，4，6，8是会有规律的避开一些洞口。我一开始只找到4这个就以为自己找到规律了，用m的因子去解的，结果肯定是不对啊，wa了很多次。最后又重新开始找，真的是容易犯错。

#include<cstdio>
int GCD(int m,int n)
{
	if(m%n==0)
	{
		return n;
	}
	else
		return GCD(n,m%n);
 } 
 int main()
 {
 	int m,n,t;
 	scanf("%d",&t);
 	while(t--)
 	{
 		scanf("%d%d",&m,&n);
 		if(GCD(m,n)==1)
 			printf("NO\n");
 		else
 			printf("YES\n");
	 }
	 return 0;
  }