HDOJ 4497 GCD and LCM
来源:互联网 发布:乎的组词 编辑:程序博客网 时间:2024/06/16 11:30
组合数学
GCD and LCM
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 451 Accepted Submission(s): 216
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.
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.
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
Source
2013 ACM-ICPC吉林通化全国邀请赛——题目重现
Recommend
liuyiding
1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 5 using namespace std; 6 7 int main() 8 { 9 int t,L,G;10 scanf("%d",&t);11 while(t--)12 {13 scanf("%d%d",&G,&L);14 if(L%G!=0)15 {16 puts("0");17 continue;18 }19 int sk=L/G;20 int pp=2,ans=1,cnt;21 while(sk!=1)22 {23 cnt=0;24 while(sk%pp==0)25 {26 cnt++;27 sk/=pp;28 }29 pp++;30 if(cnt!=0)31 {32 ans*=cnt*6;33 }34 }35 printf("%d\n",ans);36 }37 return 0;38 }
0 0
- HDOJ 4497 GCD and LCM
- HDOJ 4497 GCD and LCM
- HDOJ 4497 GCD and LCM
- HDOJ 4497 GCD and LCM(质因数分解)
- HDOJ 题目4497 GCD and LCM (组合数学,gcd性质)
- hdu 4497 GCD and LCM
- hdu 4497 GCD and LCM
- HDU - 4497 GCD and LCM
- HDU - 4497 GCD and LCM
- HDU 4497 GCD and LCM
- HDU 4497 GCD and LCM
- HDU 4497 GCD and LCM
- HDU 4497 - GCD and LCM (质因式分解 GCD LCM)
- hdoj 4497(gcd&lcm分解质因数)
- HDU 4497 GCD and LCM 解题报告
- HDU 4497GCD and LCM(素数分解)
- hdu 4497 GCD and LCM(数学知识很重要)
- hdu(4497) GCD and LCM
- HDOJ 4717 The Moving Points
- POJ 2031 Building a Space Station
- ASP.NET MVC 5 - 给电影表和模型添加新字段
- POJ 1185 炮兵阵地
- 程序员级别鉴定书(.NET面试问答集锦)
- HDOJ 4497 GCD and LCM
- ASP.NET MVC 5 - 给数据模型添加校验器
- Database Hangs Because SMON Is Taking 100% CPU Doing Transaction Recovery (Doc ID 414242.1)wy
- ;用串传送指令 将data段中的第一个字符串复制到它后面的空间
- 【Leetcode】Combination Sum (Backtracking)
- 2013成都Regional:一块木板,几个气球
- 第十周项目 4 大奖赛计分(拓展1:不定评委数)
- free programming books zh
- sdfsdfsdfds f