10204. 「一本通 6.3 例 2」Hankson 的趣味题

#include<algorithm>
#include<bitset>
#include<complex>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<cmath>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
using namespace std;
inline int read(){
    int res=0,f=1;char ch=getchar();
    while(ch<'0'ch>'9'){if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') res=res*10+ch-'0',ch=getchar();
    return res*f;
}
inline void write(int x){
    if(x<0) putchar('-'),x=-x;
    if(x<10) putchar(x+'0');
    else{
        write(x/10);
        putchar(x%10+'0');
    }
}
//queue<int> q;
//set<int> s;
//priority_queue<int> q1;
//priority_queue<int,vector<int>,greater<int> > q2;
//list<int> l;
//stack<int> s;
int T;
int a0,a1,b0,b1,ans,x;
int gcd(int a,int b){
    return b==0?a:gcd(b,a%b);
}
int main(){
    T=read();
    while(T--){
        a0=read();a1=read();b0=read();b1=read();
        int bb=b1/b0;ans=0;
        for(int i=1;i<=sqrt(b0);i++){//For gcd(x,b0)
            if(i==sqrt(b0)&&((int)(sqrt(b0)))*((int)(sqrt(b0)))==b0&&b0%(((int)(sqrt(b0))))==0){
                x=bb*((int)(sqrt(b0)));
                if(gcd(x,b0)==((int)(sqrt(b0)))&&gcd(x,a0)==a1) ans++;
                continue ;
            }
            if(b0%i==0){
                x=bb*i;
                if(gcd(x,b0)==i&&gcd(x,a0)==a1) ans++;
                x=bb*(b0/i);
                if(gcd(x,b0)==b0/i&&gcd(x,a0)==a1) ans++;
            }
        } 
        write(ans);putchar('\n');
    }
    return 0;
}