2017年3月27日
UVA 11388 GCD LCM 解题
摘要： The GCD of two positive integers is the largest integer that divides both the integers without any remainder. The LCM of two positive integers is the 阅读全文
posted @ 2017-03-27 17:11 丿月华丶唯少 阅读(208) 评论(0) 推荐(0) 编辑