两次考试

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define ll long long
#define mem(a,b) memset(a,b,sizeof(a))
#define rint register int
using namespace std;
inline void read(int &x)
{
    x=0; int ff=1; char q=getchar();
    while(q<'0'||q>'9') { if(q=='-') ff=-1; q=getchar(); }
    while(q>='0'&&q<='9') x=x*10+q-'0',q=getchar();
    x*=ff;
}
const int LEN=1006;

int t[LEN],he;
int cm;

struct bign
{
    int s[LEN],len;
    bign(){mem(s,0);len=1;}
    void read()
    {
        int i;
        he=0; char q=getchar();
        while(q<'0'||q>'9') q=getchar();
        while(q>='0'&&q<='9') t[++he]=q-'0',q=getchar();
        for(i=he;i;--i) s[he-i+1]=t[i];
        len=he;
    }
    bool operator < (const bign &c) const
    {
        bign x=*this;
        if(x.len==c.len)
        {
            int i;
            for(i=x.len;i;--i)
            {
                if(x.s[i]==c.s[i]) continue;
                return x.s[i]<c.s[i];
            }
        }
        else
            return x.len<c.len;
        return 0;
    }
    bign operator - (const bign &c) const
    {
        bign x=*this; int i;
        for(i=1;i<=c.len;++i)
        {
            x.s[i+cm]-=c.s[i];
            if(x.s[i+cm]<0)
            {
                --x.s[i+cm+1];
                x.s[i+cm]+=10;
            }
        }
        while(x.len>1&&x.s[x.len]==0)
            --x.len;
        return x;
    }
    void out()
    {
        int i;
        for(i=len;i;--i)
            printf("%d",s[i]);
        puts("");
    }
};

int T;
bign A,B;

int gcd()
{
    while( !(A.len==1&&A.s[1]==0)&&!(B.len==1&&B.s[1]==0) )
    {
        if(A<B)
        {
            cm=B.len-A.len-1;
            if(cm<0) cm=0;
            B=B-A;
        }
        else
        {
            cm=A.len-B.len-1;
            if(cm<0) cm=0;
            A=A-B;
        }
    }
    //A.out(); B.out();
    if(A<B)
    {
        if(B.len==1&&B.s[1]==1&&A.len==1&&A.s[1]==0)
            return 1;
        return 0;
    }
    else
    {
        if(A.len==1&&A.s[1]==1&&B.len==1&&B.s[1]==0)
            return 1;
        return 0;
    }
}

int main(){
    
    //freopen("T1.in","r",stdin);
    
    //freopen("king.in","r",stdin);
    //freopen("king.out","w",stdout);
    
    read(T);
    while(T--)
    {
        A.read(); B.read();
        //A.out(); B.out();
        if(gcd())
            puts("Yes");
        else
            puts("No");
    }
}