GCD and LCM HDU - 4497

最新推荐文章于 2023-01-21 12:21:26 发布

原创最新推荐文章于 2023-01-21 12:21:26 发布 · 276 阅读

本内容遵循CC 4.0 BY-SA版权协议

本文解决了一个特定的数学问题，即已知三个数的最大公约数和最小公倍数，求所有可能的数的组合。通过分析，给出了一个有效的算法实现，并附带了完整的C++代码。

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

题意：
给出三个数的最大公约数和最小公倍数，让求abc这三个数可能的情况。
思路：
这道题是看的博客，
求解的式子为
(6*(a1+1)-6 )*(6*(a2+1)-6)*(6*(a3+1)-6) ....*(6*(an+1)-6)=6*a1*6*a2*6*a3...*6*an;

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<map>
#include<math.h>
using namespace std;
typedef long long ll;
ll fun(ll n)
{
   ll m=(int)sqrt(n+0.5);
   ll ans=n,res=1;
   for(ll i=2;i<=m;i++)
if(n%i==0)
   {
       ll m=0;
       while(n%i==0)
       {
           n/=i;m++;
       }
       res*=6*m;
   }
   if(n>1) res*=6;
   return res;
}
int main()
{
   ll t;
   scanf("%lld",&t);
   ll n,m;
   while(t--)
   {
       scanf("%lld%lld",&n,&m);
       if(m%n!=0)
       {
           printf("0\n");
           continue;
       }
       ll l=m/n;
printf("%lld\n",fun(l));
   }
   return 0;
}