hdu 1222 Wolf and Rabbit
求最大公约数
#include <iostream>
using namespace std;
int gcd (int a,int b)
{
if(b == 0) return a;
return gcd(b,a%b);
}
int main()
{
int t;
while(cin>>t)
{
while(t--)
{
int a,b;
cin>>a>>b;
if(gcd(a,b) == 1) cout<<"NO"<<endl;
else cout<<"YES"<<endl;
}
}
return 0;
}