

GCD and LCMTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 5245 Accepted Submission(s): 2098 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 32bit signed integers, G and L. It’s guaranteed that each answer will fit in a 32bit signed integer. Output For each test case, print one line with the number of solutions satisfying the conditions above. Sample Input
Sample Output
Source  
