C - Wolf and Rabbit(https://vjudge.net/contest/312021#problem/C)
题目:
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.
大致意思是说一共有n个洞,标号分别为0到n-1且为环状(即0和n-1相邻),狼从标号0出发,每隔m个洞停一下,比如:m=2、n=6,狼就会经过标号为0、2、4、0、2、4…的洞,狼会经过的洞就称为不安全的洞。兔子只能藏在一个洞里,如果有安全的洞,就输出"YES",否则输出"NO"。
分析:
可发现规律,只要gcd(m,n)=0,输出"NO"
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>
using namespace std;
typedef long long ll ;
ll gcd(ll a,ll b)
{
return b==0?a:gcd(b,a%b);
}
int main()
{
ll t,m,n;
cin>>t;
while(t--)
{
cin>>m>>n;
if(gcd(m,n)==1) cout<<"NO"<<endl;
else cout<<"YES"<<endl;
}
return 0;
}