2017年2月1日
TOJ-1324 Boastin' Red Socks
摘要： You have a drawer that is full of two kinds of socks: red and black. You know that there are at least 2 socks, and not more than 50000. However, you d 阅读全文
posted @ 2017-02-01 11:59 DGSX 阅读(217) 评论(0) 推荐(0) 编辑
求最大公约数
摘要： 求最大公约数，用欧几里得算法（辗转相除法）。 阅读全文
posted @ 2017-02-01 11:05 DGSX 阅读(134) 评论(0) 推荐(0) 编辑