hdu4497 lcm and gcd

找 x,y,z的个数  x,y,z满足 gcd（x,y,z）=g，lcm（x,y,z）=l

将l/g分解质因数，对于每种质因数，3个数不能全都有，否则g要增大了，同时必须有一个数分配到所有该种质因数，否则l要减小了

#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include<stdio.h>
#include<string.h>
#include<vector>
#include<algorithm>
#include<cmath>
#include<map>
#include<queue>
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1 | 1
#define lowbit(x) x&(-x)
using namespace std;
const int N=1e5+10;
long long INF=-1e15;
const int MOD=1e9+7;
int T,n,m,k,x,y,z,l,tot,cnt;
long long ans;
bool vis[N];
int prime[N];
void getPrime(){
    memset(vis,0,sizeof vis);
    tot=0;
    for(int i=2;i<N;i++){
        if(!vis[i]){
            prime[tot++]=i;
            for(int j=2;j*i<N;j++) vis[j*i]=true;
        }
    }
}
void solve(int n){
    for(int i=0;(long long)prime[i]*prime[i]<=n;i++){
        int u=prime[i];
        if(n%u==0){
            int cnt=0;
            while(n%u==0){
                cnt++;
                n/=u;
            }
            ans*=(6*cnt);
        }


    }
    if(n>1){
        ans*=6;
    }
}
int main()
{
#ifndef  ONLINE_JUDGE
 freopen("aaa","r",stdin);
#endif
    int T;
    getPrime();
    int g,l;
    scanf("%d",&T);
    while(T--){
        scanf("%d%d",&g,&l);
        if(l%g!=0){
            puts("0");
            continue;
        }
        l/=g;
        ans=1;
        solve(l);
        printf("%I64d\n",ans);
    }
    return 0;
}