void gcd(int num1,int num2)
{
int GCD,inLarge,inSmall,inRem;
if(num1>num2)
{
inLarge = num1;
inSmall = num2;
}
else
{
inLarge = num2;
inSmall = num1;
}
inRem=inLarge%inSmall;
while(inRem!=0) /*利用回圈做輾轉相除法,當餘數為0'此時除數為最大公約數*/
{
inLarge=inSmall;
inSmall=inRem;
inRem=inLarge%inSmall;
}
GCD=insmall;
return(GCD);
}