Wolf and Rabbit

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 Input21 22 2 Sample OutputNOYES [cpp] # include <iostream> using namespace std; int gcd (int x, int y) {int c; if (x <c) {c = x; x = y; y = c;} if (y = 0) return x; else return gcd (y, x % y);} int main () {int n; cin> n; while (n --) {int a, B; cin> a> B; if (gcd (a, B) = 1) cout <"NO" <endl; else cout <"YES" <endl;} return 0 ;}