最大公約數 最小公倍數

//if a < b, it can swap their position. int gcd(int a, int b){ a = abs(a); b = abs(b); while(b != 0){ int t = a%b; a = b; b = t; } return a; } int gcd(int a, i

>>阅读原文<<