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
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
题意:
题意:
输入两个数,判断是否有最大公约数。有最大公约数输出YES,否则输出NO
最大公约数算法用辗转相除法。
代码实现
#include<iostream>
#include<cstdio>
using namespace std;
int gcd(int m,int n) //辗转相除法
{
int temp;
if(m < n)
{
temp = m;
m = n;
n = temp;
}
if(m % n == 0)
return n;
else
return gcd(n, m % n);
}
int main()
{
int p;
cin>>p;
while(p--)
{
int m,n;
cin>>m>>n;
if(gcd(m,n)==1)
cout<<"NO"<<endl;
else
cout<<"YES"<<endl;
}
}