原理:本质上取被除数模是求被除数和除数的最大公倍数。
int Devide (int val1 ,int val2)
{
int count = 1 ;
while((val1 - Multiply1(val2,count)) > 0 )
{
count++; // count is the max-multiple of them
}
return Substruction (count , 1);
}