HDU 1222 Wolf and rabbit

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1222

 

After such a long time, I finally tasted some sweetness... t_t ....

In the beginning, I thought this question was another problem with Joseph's ring. I thought we could just find that if the two numbers are mutually qualitative, that is, when their maximum common number is 1, it would be no.

1 # include <stdio. h> 2 int gcd (int m, int N) 3 {4 return M = 0? N: gcd (N % m, m); 5} 6 int main () 7 {8 int T, m, n; 9 scanf ("% d", & T ); 10 while (t --) 11 {12 scanf ("% d", & M, & N); 13 if (gcd (m, n) = 1) 14 printf ("NO \ n"); 15 else16 printf ("Yes \ n"); 17} 18}