2018年3月11日
HDU 1695 GCD(莫比乌斯反演)
摘要： Problem DescriptionGiven 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 divi 阅读全文
posted @ 2018-03-11 11:05 Styx-ferryman 阅读(307) 评论(0) 推荐(1) 编辑