【杭电-oj】-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): 7221    Accepted Submission(s): 3610

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>
int GCD(int a,int b)
{
	if(a%b==0)
		return b;
	else
		return GCD(b,a%b);
}
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int a,b;
		scanf("%d %d",&a,&b);
		int A=GCD(a,b);
		if(A==1)					//最大公约数为一,两数互质 ，每个洞口都会经过 
			printf("NO\n");
		else
			printf("YES\n");		//不互质就有洞口会漏掉 
	}
	return 0;
}