GCD and LCM
Problem Description
Given two positive integers G and L, could you tell me how many solutions of (x, y, z) there are, satisfying that gcd(x, y, z) = G and lcm(x, y, z) = L?
Note, gcd(x, y, z) means the greatest common divisor of x, y and z, while lcm(x, y, z) means the least common multiple of x, y and z.
Note 2, (1, 2, 3) and (1, 3, 2) are two different solutions.
Input
First line comes an integer T (T <= 12), telling the number of test cases.
The next T lines, each contains two positive 32-bit signed integers, G and L.
It’s guaranteed that each answer will fit in a 32-bit signed integer.
Output
For each test case, print one line with the number of solutions satisfying the conditions above.
Sample Input
2
6 72
7 33
Sample Output
72
0
解题思路:
题意很明显,不解释。
对x,y,z 和 G,L质因子分解
众所周知
gcd 是 三个数的 质因子指数最小值
lcm 是 三个数的 质因子质数最大值
那么 gcd里面有的质因子,lcm里面一定有 并且 大于他。
那么就会产生一个差值。
记 gcd的质因子分解为 a[i] lcm 的质因子分解为b[i]
可知。x,y,z 最小就是gcd 所以初始令 x,y,z 都为gcd,然后往上面乘质因子。
记 tt = b[i]-a[i] 显然 tt >= 0。
当tt > 0 时。 这个质因子 就可以有选择地分布到 x,y,z 当中去。
那么怎么分过去呢。
假设给 x,y,z 分别乘上了 c1,c2,c3 个这个质因子。
因为有gcd的限制,那么显然其中必有一个为0
因为有lcm的限制,那么显然其中必有一个为tt
因为有三个数,那么选一个为0方案数 为
C
3
1
C_3^1
C31 选一个为 tt 方案数为
C
2
1
C_2^1
C21 剩下一个位置,可以选择[0 ~ tt-1] 的任何一个数。 也就方案数为 tt。
综上所诉,一个质因子尝试的方案数为 6*(b[i]-a[i])。
所有质因子方案数累乘。
求解结束。
AC代码:
#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define pd(n) printf("%d\n", n)
#define pc(n) printf("%c", n)
#define pdd(n,m) printf("%d %d", n, m)
#define pld(n) printf("%lld\n", n)
#define pldd(n,m) printf("%lld %lld\n", n, m)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sc(n) scanf("%c",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define mem(a,n) memset(a, n, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mod(x) ((x)%MOD)
#define gcd(a,b) __gcd(a,b)
#define lowbit(x) (x&-x)
#define pii map<int,int>
#define mk make_pair
#define rtl rt<<1
#define rtr rt<<1|1
#define Max(x,y) (x)>(y)?(x):(y)
#define int long long
typedef pair<int,int> PII;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int MOD = 1e9 + 7;
const ll mod = 10007;
const double eps = 1e-9;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
//const int inf = 0x3f3f3f3f;
inline int read(){int ret = 0, sgn = 1;char ch = getchar();
while(ch < '0' || ch > '9'){if(ch == '-')sgn = -1;ch = getchar();}
while (ch >= '0' && ch <= '9'){ret = ret*10 + ch - '0';ch = getchar();}
return ret*sgn;}
inline void Out(int a){if(a>9) Out(a/10);putchar(a%10+'0');}
int qpow(int m, int k, int mod){int res=1%mod,t=m%mod;while(k){if(k&1)res=res*t%mod;t=t*t%mod;k>>=1;}return res;}
ll gcd(ll a,ll b){if(b > a) swap(a,b); return b==0?a : gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll inv(ll x,ll mod){return qpow(x,mod-2,mod)%mod;}
//const int N = 3e3+15;
int t = 1,cas = 1;
int n,m;
const int N = 1e6+15;
int prime[N],mark[N],pcnt;
int a[N],b[N];
// 如果变量名都相同的话,就不用传参了
//void getPrimes(int prime[],int N,int &pcnt)
void getPrimes()
{
memset(mark,0,sizeof(mark));
mark[0] = mark[1] = 1;
pcnt = 0;
for(int i = 2; i < N ; i ++)
{
if(!mark[i])
prime[pcnt++] = i;
for(int j = 0 ; i*prime[j] < N && j < pcnt ; j ++)
{
mark[i*prime[j]] = 1;
if(i%prime[j] == 0)
break;
}
}
}
signed main()
{
getPrimes();
cin>>t;
while(t--){
cin>>n>>m;
if(m%n != 0 || n > m){
cout<<0<<endl;
continue;
}
int tt1 = 0,tt2 = 0;
for(int i = 0 ; i < pcnt && n+m > 2; i ++){
a[i] = 0;b[i] = 0;
while(n > 1 && n%prime[i]==0){
n /= prime[i];
a[i]++;
}
while(m > 1 && m%prime[i]==0){
m /= prime[i];
b[i]++;
}
}
if(n > 1) tt1 = 1;
if(m > 1) tt2 = 1;
int ans = 1;
if(tt2-tt1) ans = 6;
for(int i = 0 ; i < pcnt ; i ++){
if(b[i] > a[i]){
int tt = b[i]-a[i];
//cout<<i<<" "<<prime[i]<<" "<<b[i]<<" "<<a[i]<<endl;
ans *= 6*tt;
}
}
cout<<ans<<endl;
}
}