#include <stack>

 1 #include <iostream>
 2 #include <stack>
 3 
 4 int main()
 5 {
 6     int num;
 7     std::stack<int>mystack;
 8 
 9     std::cin >> num;
10 
11     for (; num; num /= 2)
12     {
13         mystack.push(num % 2);//入栈
14         std::cout << "当前元素个数" << mystack.size() << std::endl;
15     }
16 
17     while (!mystack.empty())
18     {
19         std::cout << mystack.top() << " ";//返回栈顶元素
20         mystack.pop();//出栈
21     }
22 
23     return 0;
24 }