杭电hduoj 1222 Wolf and Rabbit

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1222
算法特工队QQ群：979618872 (伸手党绕边，欢迎有良好基础的人加入)

// Created by Leo Lee on 2019/4/3.


//利用反复取余的方法，a%b=c->b%c=d,直到d==0活着d==1结束，d==0则所有数走不完，d==1所有数走的完
#include <iostream>
using namespace std;
int main(){
    long long cases,step,howlong;
    cin>>cases;
    while(cases--){
        cin>>step>>howlong;
        long long tmp;
        while(step!=1 && step != 0){
            tmp = howlong%step;
            howlong = step;
            step = tmp;
        }
        if(step == 1)
            cout<<"NO"<<endl;
        else if(step == 0)
            cout<<"YES"<<endl;

    }
    return 0;
}