1222 Wolf and Rabbit

Wolf and Rabbit

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
  
  

有n个洞围成一圈，狼来抓兔子，兔子必须躲在洞里不被发现才能幸存，狼从第0个洞开始挖每数m个洞挖一次，最后问是否有兔子幸存。

其实理解了题意后，就是m和n找最大公约数是否为1

#include<cstdio>
#include<algorithm>
using namespace std;
int gcd(int a,int b)
{
    return b>0?gcd(b,a%b):a;
}
int main()
{
    int p,n,m,i;
    scanf("%d",&p);
    while(p--)
    {
        scanf("%d%d",&m,&n);
        if(gcd(max(m,n),min(m,n))==1)
        printf("NO\n");
        else
        printf("YES\n");
    }
    return 0;
}