【HDU-1222】 Wolf and Rabbit

点击打开链接

Wolf and Rabbit

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

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

 

Source

杭州电子科技大学第三届程序设计大赛

//题意是狼按每m步绕圈走 能不能把各个点走完

// 题要找规律 m与kn的关系  如果最大公约数为1的话 就可以走完所有的洞 否则就不可以

//代码如下：

#include <stdio.h>
int main()
{
	int t,n,m,k;
	int gcd(int n,int m);
	{
		scanf("%d%d",&n,&m);
		k=gcd(n,m);
		 printf("%d\n",k);
	}
return 0;
}
int gcd(int n,int m)  // GCD的一种实现方法，迭代法。 
{
	int a;
	while(m!=0)
	 {
	 	a=m;
	 	m=n%m;
	 	n=a;
	 }
return n;
}

/*

int gcd(int a,int b)
{
	if(a<b)
	 return gcd(b,a);
	else if(b==0)
	 return a;
	else
	 return gcd(b,a%b);
} 

*/     //另一种实现方法 递归实现