hdu1222

C - FB
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.

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).

For each input m n, if safe holes exist, you should output “YES”, else output “NO” in a single line.

2
1 2
2 2

NO
YES

#include<stdio.h>
int main()
{
	int p;
	scanf("%d",&p);
	while(p--)
	{
		int m,n;
		scanf("%d%d",&m,&n);
		while(n)
		{
			int k=m;
			m=n;
			n=k%n;
		}
		if(m!=1) printf("YES\n");
		else printf("NO\n");
	}
	return 0;
} 
/*证法，安全洞的存在仰赖于形成封闭的循环，
既然这样，不妨换个思路，什么时候不存在安全洞？
显然，当mn最小公因数为1时，必然不存在安全洞，因为每次循
环过一遍就会推进一位，因此只需求n与m是否互质即可。*/ 

大半夜懒得开灯手算，结果WA了两次，我好菜啊。。。。。。。