N - Wolf and Rabbit

解析：最先想到的就是，如果n % m == 0，那么就存在。但是当m == n == 1时，就不成立了，并且还存在n < m的情况，同样也可能不存在安全的洞穴。所以，就不能这么简单的想了。后来发现只要两者互素，即gcd（n， m）== 1，就存在安全洞穴，否则不存在。
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<cstdio>
#include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;
int gcd(int a,int b)
{
	return b?gcd(b,a%b):a;
}
int main()
{
	int N,n,m;
	scanf("%d",&N);
	while(N--)
	{
		scanf("%d%d",&m,&n);
		int t=gcd(m,n);
		if(t==1)printf("NO\n");
		else printf("YES\n");
		
	}
	return 0;
		
}