A C C o d e AC~Code AC Code
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
int n,a0,a1,b0,b1;
int gcd(int x,int y)
{
if(y==0)
return x;
return gcd(y,x%y);
}
int main()
{
freopen("son.in","r",stdin);
freopen("son.out","w",stdout);
cin>>n;
while(n--)
{
cin>>a0>>a1>>b0>>b1;
int p=a0/a1,q=b1/b0,ans=0; //先处理好
for(int i=1; i*i<=b1; i++)//i<=sqrt(b1)-->i*i<=b1
if(b1%i==0) //枚举
{
if(i%a1==0&&gcd(i/a1,p)==1&&gcd(q,b1/i)==1)//如公式所讲
ans++;
int y=b1/i; //确定另一个因子
if(i==y)
continue;
if(y%a1==0&&gcd(y/a1,p)==1&&gcd(q,b1/y)==1)
ans++;
}
cout<<ans<<endl;
}
return 0;
}