int div(const int x, const int y)
{
int left_num = x;
int result = 0;
while (left_num >= y)
{
int multi = 1;
while (y * multi <= (left_num >> 1))
{
multi = multi << 1;
}
result += multi;
left_num -= y * multi;
}
return result;
}
int div(const int x, const int y)
{
int left_num = x;
int result = 0;
while (left_num >= y)
{
int multi = 1;
while (y * multi <= (left_num >> 1))
{
multi = multi << 1;
}
result += multi;
left_num -= y * multi;
}
return result;
}
转载于:https://www.cnblogs.com/dartagnan/archive/2011/09/26/2192017.html