最大公约数、最小公倍数
寻找秀儿
keep quiet . keep doing
展开
-
【gcd最大公约数】【最小公倍数】
返回最大公约数: int gcd(int a,int b){return a==0?b:gcd(b%a,a);} 最小公倍数: 两数乘积除以最大公倍数原创 2019-08-22 10:06:20 · 147 阅读 · 0 评论 -
【最大公约数】Round Corridor
题目: Amugae is in a very large round corridor. The corridor consists of two areas. The inner area is equally divided by nn sectors, and the outer area is equally divided by mm sectors. A wall exists be...原创 2019-08-27 14:02:37 · 315 阅读 · 0 评论