#include <iostream> using namespace std; int gcd(int m,int n){ int c = m % n; while(c){ m = n; n = c; c = m % n; } return n; } int x,y,sum; int main(){ } A78.最大公约数和最小公倍数问题