蓝桥杯:十六进制转八进制算法

#include <iostream>
#include <string>
#include <math.h>
using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */

int main(int argc, char *argv[]) {
	int n = 0;
	cin >> n;

	string* Hex = new string[n];
	string tmpOct;
	string* Oct = new string[n];

	for (int i = 0; i<n; i++)
	{
		int CurBit = 0;
		cin >> Hex[i];

		tmpOct = "";
		Oct[i] = "";

		for (int j = Hex[i].size() - 3; j >= 0; j -= 3)
		{
			int d = 0;
			for (int k = 0; k<3; k++)
			{
				int t = j + k;
				// 16 To 10
				if (Hex[i][t] >= '0' && Hex[i][t] <= '9')
				{
					CurBit = Hex[i][t] - '0';
				}
				if (Hex[i][t] >= 'A' && Hex[i][t] <= 'F')
				{
					CurBit = Hex[i][t] - 'A' + 10;
				}

				d = d * 16 + CurBit;
			}

			// 3bit hex to 4bit oct
			int base = 7; // 111B
			for (int k = 0; k<4; k++)
			{
				tmpOct += (char)('0' + (d & base));
				d = d >> 3;
			}
			d = 0;
		}

		// last less three
		int rest = Hex[i].size() % 3;
		if (rest != 0)
		{
			int d = 0;
			for (int k = 0; k<rest; k++)
			{
				// 16 To 10
				if (Hex[i][k] >= '0' && Hex[i][k] <= '9')
				{
					CurBit = Hex[i][k] - '0';
				}
				if (Hex[i][k] >= 'A' && Hex[i][k] <= 'F')
				{
					CurBit = Hex[i][k] - 'A' + 10;
				}

				d = d * 16 + CurBit;
			}

			int base = 7; // 111B
			int max = ceil(4.0 / 3.0 * rest);
			// 1bit hex = 4/3 bit oct
			for (int k = 0; k<max; k++)
			{
				if (((k == max - 1) && (d & base) != 0) || k<max - 1)
					tmpOct += char('0' + (d & base));
				d = d >> 3;
			}
		}

		int j = tmpOct.size() - 1;
		// turn order
		for (; j >= 0; j--)
		{
			Oct[i] += tmpOct[j];
		}
	}

	for (int i = 0; i<n; i++)
	{
		cout << Oct[i] << endl;
	}

	cin >> n;
	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值