【杭电oj】1222 - Wolf and Rabbit（GCD）_杭电wolf and rabbit-CSDN博客

本文链接：https://blog.csdn.net/wyg1997/article/details/51943582

博客介绍了如何运用最大公约数(GCD)解决杭电在线判题系统(1222题)中的Wolf and Rabbit问题。作者通过分析指出，当两个数互质时，所有点都能被覆盖；反之，如果不互质，则会出现循环导致部分洞口遗漏。文中给出了相应的代码实现。

摘要由CSDN通过智能技术生成

Wolf and Rabbit

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

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

Sample Output

  
  
   
   NO
YES

Author

weigang Lee

Source

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

刚开始用的map模拟，结果爆内存了。

后来想了想，就是个GCD，如果两个数互质，那么每个点都能扫到；如果不互质，总会形成循环从而漏掉某些洞口。

代码如下：

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