若求:最小公陪数= X*Y / GCD(X,Y)
#include <stdio.h>
#include <stdlib.h>
#include <sys/time.h>
//递归
int gcd1( int m, int n)
{
int r;
if(0==(r=m%n)) return n;
return gcd1(n,r);
}
//非递归
int gcd2(int m,int n)
{
while(m!=0 && n!=0)
{
if(m>n) m%=n;
else n%=m;
}
return m==0 ? n : m;
}
int main(void) {
int m=128;
int n=68;
printf("%d\n",gcd2(m,n));
printf("%d\n",gcd1(m,n));
return 0;
}