STL栈 - 使用栈实现进制转换

问题 B: 使用栈实现进制转换

时间限制: 1 Sec   内存限制: 128 MB

题目描述

使用栈将一个很长（>30）的十进制数转换为二进制数

输入

若干个很长的十进制数

每行一个

输出

转换为二进制，每行输出一个

样例输入

123456789012345678901234567890
753951684269875454652589568545854758545824

样例输出

1100011101110100100001111111101101100001101110011111000001110111001001110001111110000101011010010
10001010011110101010001101001000100100100000101001011010001010101001000100111101011001110001000111110010001000101101111110110110100110100000

#include<cstdio>
#include<cmath>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<list>
 
using namespace std;
 
int main()
{
    string a;
    stack<char> out;
    while (cin >> a)
    {
        int rem = 0;//余数
        int bit = 0;
        stack<char> out;
        while (a > "0")
        {
            rem = 0;
            for (int i = 0; i < a.size(); i++)
            {
                bit = rem * 10 + a[i] - '0';
                a[i] = bit / 2 + '0';
                rem = bit % 2;
            }
            out.push(rem + '0');//将余数压栈
            string::iterator zend;
            zend = a.begin();
            while (*zend == '0'&&zend<(a.end()-1))zend++;
            a.erase(a.begin(), zend);
        }
        while (!out.empty())
        {
            char temp = out.top();
            cout << temp;
            out.pop();
        }
        cout << endl;
    }
    return 0;
}