题解 | #二进制数#

常规思路

#include <iostream>
#include <string>
#include <stack>
using namespace std;

string convertFunc(int x) {
    stack<int> sck;
    while (x) {
        int bit = x % 2;
        sck.push(bit);
        x = x / 2;
    }
    string s;
    while (!sck.empty()) {
        s.push_back(sck.top()+'0');
        sck.pop();
    }
    return s;
}

int main()
{
    int n;
    while (cin >> n) {
        cout << convertFunc(n) << endl;
    }
    return 0;
}