#include <iostream>
#include <cstdlib>
using namespace std;
//非递归算法,防止溢出
int integer_div_function(unsigned int dividend, unsigned int divisor) {
if(dividend < divisor) //小优化
return 0;
unsigned int k, c, res = 0;
while(dividend > divisor) { //位运算缩小范围
for(k = 0, c = divisor; dividend >= c; c <<= 1, k++) { //快速靠近答案
if(dividend - c < divisor) {
res += 1 << k; //累积除数
break;
}
}
if(dividend - c < divisor)
break;
res += 1 << (k - 1); //累积除数
dividend -= c >> 1;
}
return res;
}
//极简单的main函数
int main() {
freopen("frisbee.in", "r", stdin) ;
freopen("frisbee.out", "w", stdout);
unsigned int a, b;
cin >> a >> b;if (a==b) cout << 1 << endl;
else if (b==1) cout << a << endl;
else cout << integer_div_function(a, b)<<endl;
}
问题描述:
输入P (0 <= P <= 2,000,000,000) 和 Q(1 <= Q <= 2,000,000,000) ,
输出 P除以Q 并且 截尾(取整),不准用”div”命令.
输入
7 2
输出
3
说明:
7/2=3.5 取整后得3