GCD & LCM 一个神奇的式子
摘要:
DescriptionGiven 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.Inputx and y, one line for each test.OutputNumber of pairs of p and q.Sample Input3 60Sample Output4这道题的精 阅读全文
posted @ 2012-08-21 22:30 yumao 阅读(2602) 评论(0) 推荐(0)
浙公网安备 33010602011771号