poj 2105

最新推荐文章于 2016-01-16 16:00:35 发布

daweibayu123

最新推荐文章于 2016-01-16 16:00:35 发布

阅读量583

点赞数

分类专栏：算法 poj

本文链接：https://blog.csdn.net/daweibayu123/article/details/12509991

版权

算法同时被 2 个专栏收录

8 篇文章 0 订阅

订阅专栏

poj

6 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <string>
using namespace std;

char numToChar(int num)
{
		return num + '0';
}

int baseStrToInt(const string& sequence, int base)
{
	int result = 0;
	for(int i = 0; i < sequence.length(); i++)
	{
		result = result*base + sequence[i] - '0';
	}
	return result;
}

string intToBaseStr(int num, int base)
{
	string result;
	while(num)
	{
		result = numToChar(num % base) + result;
		num /= base;
	}
	if(result.empty())
		result = "0";
	return result;
}

int main()
{
	int n;
	string sequence;
	cin >> n;
	while(n--)
	{
		cin >> sequence;
		string result = "";
		result += intToBaseStr(baseStrToInt(sequence.substr(0, 8), 2), 10) + ".";
		result += intToBaseStr(baseStrToInt(sequence.substr(8, 8), 2), 10) + ".";
		result += intToBaseStr(baseStrToInt(sequence.substr(16, 8), 2), 10) + ".";
		result += intToBaseStr(baseStrToInt(sequence.substr(24, 8), 2), 10);
		cout << result << endl;
	}
}