除2取余法,先得到的是低位,后得到的是高位。所以可以用栈思想计算

二、源码

   2:  
int a)
   4: {
int i = 0, stack[10], r, s;
   6:  
do
   8:     {
   9:         r = a / 2;
  10:         s = a % 2;
  11:         stack[i] = s;
if (r != 0)
  13:         {
  14:             i++;
  15:             a = r;
  16:         }
while(r);
  18:  
for (; i >= 0; --i)
  20:     {
, stack[i]);
  22:     }
);
  24: }
  25:  
int main()
  27: {
int a;
);
, &a);
  31:     DeToBi(a);
return 0;
  33: }

相关文章:

  • 2022-03-05
  • 2021-06-03
  • 2021-11-28
  • 2021-09-15
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
猜你喜欢
  • 2022-12-23
  • 2021-04-13
  • 2021-04-13
  • 2021-06-15
  • 2022-12-23
  • 2021-11-22
  • 2022-12-23
相关资源
相似解决方案