A 题目链接:https://ac.nowcoder.com/acm/contest/127263/A 思路: xy-lcm(x, y) = xy-xy/gcd(x,y) = xy(1-1/gcd(x,y) 我们发现0 <=1-gcd(x,y) <= 1,要使最小化,当且仅当gcd = 1; 代码: /*Don’t cut corners, don’t over-rely on AI. Stay grounded, and keep challenging yourself with every single problem.*/ #include <bits/stdc++...