liluoyu_1016的博客

原创 GCD HDU - 1695 莫比乌斯模板

Given 5 integers: a, b, c, d, k, you're to find x in a...b, y in c...d that GCD(x, y) = k. GCD(x, y) means the greatest common divisor of x and y. Since the number of choices may be very large, you're...