zoj 1334 Basically Speaking

最新推荐文章于 2020-02-12 12:28:41 发布

yzl_rex

最新推荐文章于 2020-02-12 12:28:41 发布

阅读量534

点赞数

分类专栏： ZOJ 文章标签： include string ios c

本文链接：https://blog.csdn.net/yzl_rex/article/details/7367082

版权

ZOJ 专栏收录该内容

137 篇文章 0 订阅

订阅专栏

#include "iostream"
#include "map"
#include "string"
#include "cmath"
#include "algorithm"
#include "iomanip"
using namespace std;

int main()
{
	string str, ans;
	int b1, b2, i, j, len1, len2, num;
	map<char, int> m;
	//下面的映射由字母转换为数字！
	m['0'] = 0, m['1'] = 1, m['2'] = 2, m['3'] = 3, m['4'] = 4, m['5'] = 5, m['6'] = 6, m['7'] = 7, m['8'] = 8, m['9'] = 9,
	m['A'] = 10, m['B'] = 11, m['C'] = 12, m['D'] = 13, m['E'] = 14, m['F'] = 15;
	while (cin >> str >> b1 >> b2)
	{
		num = 0;
		ans = "";
		len1 = str.length();
		for (i = len1-1, j = 0; i >= 0; i--, j++)
			num += m[str[i]] * pow(b1, double(j));
		while (num)
		{
			int temp;
			temp = num % b2;
			if (temp >= 10)//由数字转换为字母！
			{
				switch(temp)
				{
				case 10: 
					ans += 'A';
					break;
				case 11:
					ans += 'B';
					break;
				case 12:
					ans += 'C';
					break;
				case 13:
					ans += 'D';
					break;
				case 14:
					ans += 'E';
					break;
				case 15:
					ans += 'F';
					break;
				}
			}
			else 
			    ans += num % b2 + 48;
			num /= b2;
		}
		len2 = ans.length();
		if (len2 > 7)
			cout << "  ERROR" << endl;
		else
		{
			reverse(ans.begin(), ans.end());
			cout <<setiosflags(ios::right); //c++输出控制！
			cout << setw(7) << ans << endl;
		}
	}
}