Hangzhou Electric Acm1222--wolf and rabbit~~ greatest common divisor

The meaning of the title is: the Rabbit casually hide in a hole, the wolf from the hole No. 0 began to find, every time to find the next is a number of M, all the holes formed ring.

Input m and n, Hole is number No. 0 to n-1.

The greatest common divisor of M and N is 1, and the wolf can be found in every hole. Otherwise, some holes are ignored, and those holes are safe.

The following is the code for the AC:

#include <iostream>using namespace Std;int GCD (int a, int b) {int c;while (b) {c = a% B;a = B;b = C;} return A;} int main () {int m, n, i;cin >> i;while (i--) {cin >> m >> n;if (GCD (m, n) = = 1) cout << "NO" << E Ndl;elsecout << "YES" << Endl;} return 0;}

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Hangzhou Electric Acm1222--wolf and rabbit~~ greatest common divisor