IP Address-2015

IP Address

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 19267		Accepted: 11132

Description

Suppose you are reading byte streams from any device, representing IP addresses. Your task is to convert a 32 characters long sequence of '1s' and '0s' (bits) to a dotted decimal format. A dotted decimal format for an IP address is form by grouping 8 bits at a time and converting the binary representation to decimal representation. Any 8 bits is a valid part of an IP address. To convert binary numbers to decimal numbers remember that both are positional numerical systems, where the first 8 positions of the binary systems are: 

27   26  25  24  23   22  21  20 

128 64  32  16  8   4   2   1 

Input

The input will have a number N (1<=N<=9) in its first line representing the number of streams to convert. N lines will follow.

Output

The output must have N lines with a doted decimal IP address. A dotted decimal IP address is formed by grouping 8 bit at the time and converting the binary representation to decimal representation.

Sample Input

4
00000000000000000000000000000000 
00000011100000001111111111111111 
11001011100001001110010110000000 
01010000000100000000000000000001 

Sample Output

0.0.0.0
3.128.255.255
203.132.229.128
80.16.0.1

Source

/***********************************************************************
    Copyright (c) 2015,wangzp
    All rights no reserved.
  
    Name: 《IP Address》In PEKING UNIVERSITY ACM
    ID:   PROBLEM 2105
    问题简述: 根据输入的二进制码翻译生成IP地址。
    Date: Aug 10, 2015 
 
***********************************************************************/
#include 
   
   
    
    

int power(int m,int n);
int main(void)
{
	
	int n;
	int a,b,c,d;
	char s[33];	
	int A[8],B[8],C[8],D[8];
	scanf("%d",&n);
	int i,j,k;
	for (i = 0;i < n;i++)
	{
		scanf("%s",s);
		for (j = 0; j < 8;j++)
		{
			A[j] = (int) (s[j] - '0'); 
		}
		for (j = 8; j < 16; j++)
		{
			B[j - 8] = (int) (s[j] - '0');
		}
		for (j = 16; j < 24; j++)
		{
			C[j - 16] = (int) (s[j] - '0');
		}
		for (j = 24; j < 32; j++)
		{
			D[j - 24] = (int) (s[j] - '0');
		}

		a = 0;
		b = 0;
		c = 0;
		d = 0;
		for (k = 0; k < 8; k++)
		{
			a += A[k] * power(2,7 - k);
			b += B[k] * power(2,7 - k);
			c += C[k] * power(2,7 - k);
			d += D[k] * power(2,7 - k);
		}
		printf("%d.%d.%d.%d\n",a,b,c,d);
	}
	return 0;
}

int power (int m,int n)
{
	int i,sum = 1;
	for (i = 0; i < n; i++)
	{
		sum *= m;
	}
	return sum;
}