Sixth week of training the mathematics concept and method probability number theory greatest common divisor g problem

Description

There is a hill with n holes around. The holes is 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 was the one signed with 0. Then he'll get into the hole every m holes. For example, m=2 and n=6, the Wolf would get into the holes which is signed 0,2,4,0. If the rabbit hides in the hole which signed 1,3 or 5, she'll 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, the If safe holes exist, you should output "YES", and Else Output "NO" in a.

Sample Input

21 22 2

Sample Output

NOYES gives two numbers, if their convention number is greater than 1, the output is yes, otherwise the output no

#include"iostream"using namespacestd;intgcdintAintb) {    returnb==0? A:GCD (b,a%b);}intMain () {intT,m,n; CIN>>T;  while(t--) {cin>>m>>N; cout<< ((gcd (m,n) >1)?"YES":"NO") <<Endl; }    return 0;}

View Code

Sixth week of training the mathematics concept and method probability number theory greatest common divisor g problem