[HDU 1695]GCD
摘要：
【问题描述】 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 阅读全文
posted @ 2016-04-24 11:31 Double680 阅读(144) 评论(0) 推荐(0) 编辑
