2017年9月1日
HDU 1695 GCD
摘要： Problem Description 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 div 阅读全文
posted @ 2017-09-01 21:07 PIPIBoss 阅读(126) 评论(0) 推荐(1) 编辑