hdoj 1222 Wolf and Rabbit 【GCD】

Wolf and Rabbit

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

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
  
  

 

想一想一圈一圈的走，如果n,m有公约数，当走到重复时，从0到n-1就会有空余的，那么求出它们的最大公约数就好

最大公约数为1，则没有空余的洞；

最大公约数>1，则有空余的洞。

代码：

#include<cstdio>
int GCD(int a,int b)<span style="white-space:pre">	</span>//最大公约数递归函数
{
	if(a%b==0)
	{
		return b;
	}
	else
		return GCD(b,a%b);
 } 
 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;
  }