Hdu1222、 6thweek trainnig_G 最大公约数

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

 

分析：

关键在于判断这两个数是否互质，互质则兔子无法逃跑。

 

代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
int t;
int gcd(int a,int b)
{
    while(b)
    {
       t=a%b;
       a=b;
       b=t;
    }
    return a;
}
int main()
{
    int p,m,n;
    scanf("%d",&p);
    while(p--)
    {
        scanf("%d%d",&m,&n);
        if (gcd(m,n)==1)
            printf("NO
");
        else
            printf("YES
");

    }
    return 0;
}