数据结构实验之栈一：进制转换

Problem Description

Input

Output

Example Input

1279
8

Example Output

2377

Author

#include <bits/stdc++.h>
using namespace std;

int main()
{
int i,j,n,m,k;
stack <int> sta;

cin>>n>>m;

while(n>0)
{
sta.push(n%m);
n=n/m;
}
while(!sta.empty())
{
int key;
key=sta.top();
sta.pop();
cout<<key;
}
cout<<endl;
return 0;
}