#P458. 【例83.4】最大公约数和最小公倍数
【例83.4】最大公约数和最小公倍数
Description
Input two positive integers ,, and find the number of pairs , that satisfy the following conditions:
- , are positive integers.
- , must have as their greatest common divisor and as their least common multiple.
Find the number of all possible pairs , that satisfy these conditions.
Input Format
A single line containing two positive integers ,.
Output Format
A single line containing one number, representing the number of pairs , that satisfy the conditions.
Sample
3 604