HDU Wolf and rabbit

Wolf and rabbit

Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)

Total submission (s): 335 accepted submission (s): 214

Problem descriptionthere 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. if the rabbit hides in the hole which signed 1, 3 or 5, she will keep ve. so we call these holes the safe holes.

Inputthe 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 shoshould output "yes", else output "no" in a single line.

Sample Input 21 22 2

sample output Noyes # include # include using namespace STD; int main () {< br> int T, m, n; CIN> T; while (t --) {< br> CIN> m> N; while (n> M? (N = n % m) :( M = m % N); If (n + M = 1) printf ("NO \ n "); else printf ("Yes \ n"); }< br> return 0; }