题解 | #二进制数#

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

int main() {
    int n;
    while (scanf("%d", &n) != EOF) {
        stack<int> binary;
        while (n != 0) {
            binary.push(n % 2);
            n /= 2;
        }
        while (!binary.empty()) {
            printf("%d", binary.top());
            binary.pop();
        }
        printf("\n");
    }
}