POJ 2105 解题报告

没啥好说的。

2105

Accepted

132K

0MS

C++

875B

/* 
ID: thestor1 
LANG: C++ 
TASK: poj2105 
*/
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <limits>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <cassert>

using namespace std;

int binarytoint(char line[], int s)
{
	int ip = 0;
	for (int i = s; i < s + 8; ++i)
	{
		ip = (ip << 1) + line[i] - '0';
	}
	return ip;
}


int main()
{
	int N;
	char line[33];
	scanf("%d", &N);
	// printf("N: %d\n", N);
	for (int i = 0; i < N; ++i)
	{
		scanf("%s", line);
		// printf("[%s]\n", line);
		for (int k = 0; k < 4; ++k)
		{
			printf("%d", binarytoint(line, k * 8));
			if (k != 3)
			{
				printf(".");
			}
			else
			{
				printf("\n");	
			}
		}
	}
	return 0;  
}