6
22
2016
0

代码模板库·

数学:

最大公约数与最小公倍数

LL gcd(LL x,LL y){return y==0?x:gcd(y,x%y);}
LL lcm(LL x,LL y){return x*y/gcd(x,y);}
Category: 总结 | Tags: 模板 | Read Count: 352

登录 *


loading captcha image...
(输入验证码)
or Ctrl+Enter

Host by is-Programmer.com | Power by Chito 1.3.3 beta | Theme: Aeros 2.0 by TheBuckmaker.com