根据欧几里得算法 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); while (in.hasNext()) { long a = in.nextLong(); long b = in.nextLong(); long max = gcb(a,b); //最小公倍数 long min = a*b/gcb(a,b); System.out.println(max+min); } } //最大公约数 p...