{"trustable":true,"prependHtml":"\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\(\u0027, right: \u0027\\\\)\u0027, display: false},\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eGiven x and y (2 \u0026lt;\u003d x \u0026lt;\u003d 100,000, 2 \u0026lt;\u003d y \u0026lt;\u003d 1,000,000), you are \n to count the number of p and q such that: \u003c/p\u003e\n\u003cp\u003e1) p and q are positive integers;\u003c/p\u003e\n\u003cp\u003e2) GCD(p, q) \u003d x;\u003c/p\u003e\n\u003cp\u003e3) LCM(p, q) \u003d y.\u003c/p\u003e\n\u003cp\u003e\u003cbr\u003e\n \u003cb\u003eInput\u003c/b\u003e\u003c/p\u003e\n\u003cp\u003ex and y, one line for each test.\u003c/p\u003e\n\u003cp\u003e\u003cbr\u003e\n \u003cb\u003eOutput\u003c/b\u003e\u003c/p\u003e\n\u003cp\u003eNumber of pairs of p and q.\u003c/p\u003e\n\u003cp\u003e\u003cbr\u003e\n \u003cb\u003eSample Input\u003c/b\u003e\u003c/p\u003e\n\u003cp\u003e3 60\u003c/p\u003e\n\u003cp\u003e\u003cbr\u003e\n \u003cb\u003eSample Output\u003c/b\u003e\u003c/p\u003e\n\u003cp\u003e4\u003c/p\u003e\n\u003cp\u003e\u003cbr\u003e\n\u003c/p\u003e\n"}}]}