P1072 Hankson的趣味题

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define inf 1000000000
#define N 50000
#define ll long long

using namespace std;
int read()
{
    int x=,f=;char ch=getchar();
    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
    while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
    return x*f;
}

int n,tot;
int a0,b0,a1,b1,ans;
int pri[];
bool mark[];
void getpri()
{
    for(int i=;i<=N;i++)
    {
        if(!mark[i])pri[++tot]=i;
        for(int j=;j<=tot&&pri[j]*i<=N;j++)
        {
            mark[pri[j]*i]=;
            if(pri[j]%i==)break;
        }
    }
}
void solve(int x)
{
    int c0=,c1=,c2=,c3=;
    while(a0%x==){a0/=x;c0++;}
    while(a1%x==){a1/=x;c1++;}
    while(b0%x==){b0/=x;c2++;}
    while(b1%x==){b1/=x;c3++;}
    if(c0==c1&&c2==c3)
        {
        if(c1<=c3)ans*=c3-c1+;
        else ans=;
        }
    else if(c0!=c1&&c2!=c3&&c1!=c3)ans=;
}
int main()
{
    getpri();
    n=read();
    while(n--)
    {
        ans=;
        a0=read();a1=read();b0=read();b1=read();
        for(int i=;i<=tot;i++)
            solve(pri[i]);
            if(b1!=)solve(b1);
        printf("%d\n",ans);
    }
}