欧几里德算法（求两个数的最大公约数）

求两个数的最大公约数

#include<stdio.h>int main(){unsigned int Gcd(unsigned int M,unsigned int N);int a,b;printf("please enter two numbers:\n");scanf("a=%u b=%u",&a,&b);printf("the greatest common divisor is %u",Gcd(a,b));return 0;}unsigned int Gcd(unsigned int M,unsigned int N){unsigned int Rem;while(N>0){Rem=M%N;M=N;N=Rem;}return M;}