ZOJ Problem Set - 1577
Given x and y (2 <= x <= 100,000, 2 <= y <= 1,000,000), you are to count the number of p and q such that:
1) p and q are positive integers;
2) GCD(p, q) = x;
3) LCM(p, q) = y.
x and y, one line for each test.
Number of pairs of p and q.
Author: ZHOU, Qiang
Source: ZOJ Monthly, April 2003