求两数最大公约数----辗转相除法(C语言)
1 int gcd(int a,int b)
2 {
3 if(a<b){int t;t=a;a=b;b=t;}
4 while(a%b!=0)
5 {
6 int y=a-b;
7 if(b<y)a=y;
8 else {a=b;b=y;}
9 }
10 return b;
11 }
1 int gcd(int a,int b)
2 {
3 if(a<b){int t;t=a;a=b;b=t;}
4 while(a%b!=0)
5 {
6 int y=a-b;
7 if(b<y)a=y;
8 else {a=b;b=y;}
9 }
10 return b;
11 }