//最小公倍数=两整数的乘积/最大公约数 //公约数用辗转相除法求出,就是loop array #include <stdio.h> int gcd(int a,int b){ while(b){ int t = a%b; //能余说明能约 a = b; b=t; } return a; } int main() { long long n,m; scanf("%lld %lld",&n,&m); long long res = gcd(n,m); long long minmul = n*m/res; printf("%lld",res+minmul); retu...