1.累加
#include <iostream>
#include <cmath>
using namespace std;
int num (int a)
{
int b = 0;
int i = 0;
int result = 0;
for (; a >= 2;i++)
{
b = a % 2;
a /= 2;
result += (b * pow(10,i));
}
result += (a* pow(10,i));
return result;
}
int main()
{
int n;
cin >>n;
cout <<num(n);
return 0;
}
以下摘自
https://blog.csdn.net/huplion/article/details/43016599?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522158364201419195239814797%2522%252C%2522scm%2522%253A%252220140713.130056874…%2522%257D&request_id=158364201419195239814797&biz_id=0&utm_source=distribute.pc_search_result.none-task
纯属为了以后查看方便(^ _ ^)
2.利用递归
#include<iostream>
using namespace std;
void f(int n)
{
if (n > 0)
{
f(n / 2);
cout << n % 2;
}
}
int main()
{
int n;
cout << "请输入一个整数:" << endl;
cin >> n;
f(n);
return 0;
}
3.利用数组
#include<iostream>
using namespace std;
int main()
{
int s[100];
int count=0,n;
cout << "请输入一个正整数:" << endl;
cin >> n;
while (n != 0)
{
s[++count] = n % 2;
n = n / 2;
}
for (; count > 0; count--)
{
cout << s[count];
}
return 0;
}
4.利用栈
#include<iostream>
#include<stack>
using namespace std;
stack<int>STD;
int main()
{
int n;
cout << "请输入一个正整数:" << endl;
cin >> n;
while (n != 0)
{
STD.push(n % 2);
n = n / 2;
}
while (!STD.empty())
{
cout << STD.top();
STD.pop();
}
return 0;
}