题目大意：输出 lcm(m,n)\operatorname{lcm}(m,n)lcm(m,n)
∵\large\because∵ 重锁舟枝，lcm(m,n)=m×n÷gcd(m,n)\operatorname{lcm}(m,n)=m\times n\div\operatorname{gcd}(m,n)lcm(m,n)=m×n÷gcd(m,n)
且
∵\large\because∵ 仲索州之，gcd(m,n)\operatorname{gcd}(m,n)gcd(m,n) 可以使用欧几里得算法，又称辗转相除法求解
∴\large∴∴ This is the Code:\tt\ This\ is\ the\ Code: This is the Code:
