J - Good Coins Gym - 101020J

It was a beautiful day, the sun was shining, the sky was clear and king Omar was listening to the birds peacefully under his favorite apple tree. Suddenly, an apple fell down and hit his head, and an idea came to him, he decided to reduce the types of coins in his kingdom to two types only. To take a wise choice, he had to choose good coins. We call a group of two coins good if we can exchange any integer amount of money by using them. For example, you can exchange any amount of money by using coins which have the values 3 and 4 so the group {3, 4} is good but you can’t exchange the amount 3 if the two coins have the values 2 and 6, so the group {2, 6} isn’t good. You are about to help king Omar to choose a good group of coins to be the national coins from a set of choices. You program have to test T group of two members where 0<T<5000, and print “GOOD” if the group is good, and “NOT GOOD” if it is not.

Input
The first line of the input contains T the number of test cases, followed by T lines, each line contains tow integers x,y separated by a space and 0 < x,y  ≤  10 ^{} 7

Output
For each line of the input print “GOOD” if {x,y} is good and “NOT GOOD” if it is not.

Examples

Input

4
3 4
2 6
19739 6101
3636 351

Output

GOOD
NOT GOOD
GOOD
NOT GOOD

Note
If someone X wants to give another one Y the amount 4 and the available coins have the values 3 and 5, then X can give Y 8 coins of the value 5 and Y give X 12 coins of the value 3 . 8x5-12x3=4

只要这两个数的最大公因数是1，就可以用一表示所有的数。

#include<bits/stdc++.h>


#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cstring>
#include<cstdlib>

using namespace std;

int main()
{
         int t;
         cin>>t;
         while(t--)
         {
                int n,m;
                cin>>n>>m;
                if(__gcd(n,m)==1)
                   cout<<"GOOD"<<endl;
                else
                   cout<<"NOT GOOD"<<endl;
         }
         return 0;
}

如果有写得不好或不正确的地方，欢迎大家指出。