求条，又WA又T

#include <bits/stdc++.h>
using namespace std;
#define gcd __gcd
int lcm(int a,int b)
{
    return a*b/gcd(a,b);
}
int t,a0,a1,b0,b1;
signed main()
{
    ios::sync_with_stdio(0);cin.tie(0);
	cin>>t;
    while(t--)
    {
        int ans=0;
        cin>>a0>>a1>>b0>>b1;
        for(int i=1;i<=b1/i;i++)
        {
            if(b1%i!=0)
            {
                if(gcd(a0,i)==a1&&lcm(b0,i)==b1) ans++;
            }
            if(b1/i!=i)
            {
                if(a1==gcd(b1/i,a0)&&lcm(b1/i,b0)==b1) ans++;
            }
        }
        cout<<ans<<"\n";
    }
    return 0;
}