1008: GCD again !
[Creator : ]
Description
Given two integers G and L ( 2<= G <= 100,000 and 2 <= L <= 1000,000 ) , please find all positive integer A and B such that G is gcd(A, B) and L is lcm(A, B).
Input
One line with two integers which is G and L
Output
One integer which is the number of A and B
Sample Input Copy
3 60
Sample Output Copy
4
HINT
Given 3 and 60, there are following group of A and B
(3 60) (15 12) (12 15) (60 3), therefore the answer is 4
(3 60) (15 12) (12 15) (60 3), therefore the answer is 4