test.cpp

来自「栈的应用（1）数制转换」· C++ 代码 · 共 52 行

#include"Stack.h"
#include<iostream.h>
//利用栈进行数制转换
ElementType GetRemain(int n);

void main()
{	SqStack s;
	ElementType e;
	int n,radix;
	InitSqStack(s);
	cout<<"Please input the radix and the number"<<endl;
	cin>>radix>>n;
	while(n){
		e=GetRemain(n%radix);
		Push(s,e);
		n=n/radix;
	}
//	PrintSqStack(s);
	
	while(!IsSqStackEmpty(s))
	{
		Pop(s,e);
		cout<<e<<" ";
	}
	cout<<endl;
}
ElementType GetRemain(int n)
{
	switch(n){
	case 0:return '0';break;
	case 1:return '1';break;
	case 2:return '2';break;
	case 3:return '3';break;
	case 4:return '4';break;
	case 5:return '5';break;
	case 6:return '6';break;
	case 7:return '7';break;
	case 8:return '8';break;
	case 9:return '9';break;
	case 10:return 'A';break;
	case 11:return 'B';break;
	case 12:return 'C';break;
	case 13:return 'D';break;
	case 14:return 'E';break;
	case 15:return 'F';break;
	case 16:return 'G';break;
	case 17:return 'H';break;
	case 18:return 'I';break;
	case 19:return 'J';break;
	}
}