寂寞致幻

摘要： #include using namespace std; int main() { int m,n,a,b,m1; cout > m >> n; if(m>n) { a=m; b=n; } else { a=n; b=m; } while(m1!=0) { m1=a%b; a=b; b=m1; } cout << "最大公约数=" << a<<endl; co... 阅读全文