摘要: #include<stdio.h> int div(const int x,const int y){ return x/y; } //位移,效率高 int myDiv(const int x,const int y){ int tmpY = y; int dividend = x; int result = 0; while( dividend >= y ){ int lsCount = 0; //left shift counter while( tmpY <= (dividend >> 1) ){ ... 阅读全文
posted @ 2012-10-17 10:58 林间走寸 阅读(329) 评论(0) 推荐(0)