栈的应用——数值转换

•十进制数和其它进制数的转换是计算机实现计算的基本问题

•问题：把十进制数N转换为d进制数

•算法策略:重复下面两步，直至N等于0

        –x=N mod d (mod为求余运算)

        –N=N div d (div为整除运算)

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int ten_number, switch_number;
    cin >> ten_number >> switch_number;
    stack<int> result_number;

    int n = ten_number;
    while (n != 0)
    {
        int stack_number = n % switch_number;
        result_number.push(stack_number);
        n /= switch_number;
    }

    while (!result_number.empty())
    {
        int x = result_number.top();
        result_number.pop();
        cout << x;
    }

    return 0;
}

852 8
1524