004.利用循环迭代实现十进制数转化为N进制数

#include"Stack.h"

using namespace std;


void convert(Stack<char>& S, __int64 n, int base)
{
	//十进制正整数n到base进制的转换(递归版)
	static char digit[] 	//0<n,1<base<=16,,新进之下的数位符号，可视base取值范围适当扩充
		= { '0','1','2','3','4','5','6','7','8','9','A','B','C','D' ,'E','F' };
	while (n > 0)
	{
		//由低到高，逐一计算出新进制下的各数位
		int remainder = (int)(n % base);
		S.push(digit[remainder]);//(余数)当前位入栈
		n /= base;//n更新为其对base的除商
	}
}//新进制下由高到低的各数位，自顶而下保存于栈S中


int main()
{
	Stack<char> assist;
	convert(assist, 1024, 2);
	while (!assist.empty())
	{
		cout << assist.top();
		assist.pop();
	}
	system("pause");
	return 0;
}