求两个数的最大公约数和最小公倍数的方法（注意排除Duger）

/*****************************************
FileName:/mnt/hgfs/share/doc/mathcount.c
Author:Peng Senrong
E_mail:469139522@qq.com 2016-03-16 22:08
*****************************************/
#include <stdio.h>

void mathmax(unsigned int num1,unsigned int num2)
{
unsigned int re;
if(num1<num2)
{
num1+=num2;
num2=num1-num2;
num1=num1-num2;
}

re=num1%num2;
if(re==0)
printf("The common divisor is:\t%d\n",num2);
else
{
do
{
num1=num2;
num2=re;
re=num1%num2;
if(re==0)
printf("The common dicisor is:\t%d\n",num2);
}while(re!=0);
}
return ;
}


void mathmin(unsigned int num1,unsigned int num2)
{
unsigned int re;
unsigned int value1,value2;
unsigned int sum;
unsigned int atemp,btemp;
if(num1<num2)//交换两个数，利用较大作为被除数
{
num1+=num2;
num2=num1-num2;
num1-=num2;
}

re=num1%num2;
if(re==0)
{
printf("the common mutiple is:\t%d\n",num1);

}

else
{
do
{
atemp=num2;
btemp=re;
re=atemp%btemp;
if(re==0)
{
value1=num1/btemp;
value2=num2/btemp;
sum=value1*value2*btemp;
printf("the common mutiple is:\t%d\n",sum);
}
}while(re!=0);
}
return ;


}

int main(int argc,char **agrv)
{
unsigned int input_num,input_value;
printf("input two value_number:\t");
scanf("%d%d",&input_num,&input_value);
mathmax(input_num,input_value);
mathmin(input_num,input_value);
return 0;
}