ranhua686
//递归实现将十进制转化为二进制.cpp

#include <iostream>
using namespace std;
long transform(int n)
{
    int result;
    if(n==0)
        result=0;
     else if(n/2==0)
        result=1;
    else
        result=n%2+transform(n/2)*10;
    return result;
}
void main()
{
    int n,m;
    cout<<"Please enter an integer:";
        cin >>n;
    m=transform(n);
    cout<<n<<" into binary is "<<m<<endl;
}

 

分类:

技术点:

相关文章:

  • 2021-10-16
  • 2021-12-04
  • 2021-09-04
  • 2022-12-23
  • 2021-07-07
  • 2022-12-23
  • 2021-12-31
  • 2022-12-23
猜你喜欢
  • 2022-12-23
  • 2021-04-29
  • 2022-12-23
  • 2021-10-15
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
相关资源
相似解决方案