欧几里德算法--求最大公约数 unsigned int Gcd(unsigned int M,unsigned int N) { unsigned int Rem; while(N > 0) { Rem = M % N; M=N; N=Rem; } return M; }