#include <stdio.h>
int main()
{
int p,m,n,i;
scanf("%d",&p);
for(i=0;i<p;i++)
{
scanf("%d%d",&m,&n);
if(m!=1&&n%m==0&&n!=1&&n>m) printf("YES\n");
else if(m!=1&&m%n==0&&n!=1&&n<=m) printf("YES\n");
else printf("NO\n");
}
return 0;
}
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 mn, 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=1和m=1时都是“NO”。
第二:注意m和n的大小关系。