int gcd(int m,int n)//最大公约数 { int t;if(m<n)t = n,n = m,m = t;if(n == 0) return m;else return gcd(n,m%n);} int lcm (int m,int n)//最小公倍数 { return m*n/gcd(m,n);} int main(){ int m,n;while(scanf("%d %d",&m,&n) == 2) { pr...