HUNAN UNIVERSITY ACM/ICPC Judge Online_Problem 10049_IP Address

最新推荐文章于 2022-08-27 08:32:52 发布

原创最新推荐文章于 2022-08-27 08:32:52 发布 · 650 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#numbers #output #input #date #byte

HUNAN UNIVERSITY ACM/ICPC Judge Online 试题专栏收录该内容

14 篇文章

订阅专栏

IP Address

Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB

Total submit users: 649, Accepted users: 624

Problem 10049 : No special judgement

Problem 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

Problem Source

MCA 2004

CODE

/*

  Name: 10049_IP Address

  Copyright:  yangchun's

  Author:  yangchun

  Date: 14-06-08 21:06

  Description: HUNAN UNIVERSITY ACM/ICPC Judge Online_Problem 10049_IP Address 

*/



#include <algorithm>

#include <iostream>



using namespace std;



int main()

{

    //freopen("in.txt","r",stdin);

    //freopen("out.txt","w",stdout);

    

    int N,num,pow_2[8] = {1,2,4,8,16,32,64,128};

    char ch;

    

    scanf("%d",&N);

    while(N--)

    {

         scanf("%c",&ch);

         

         for(int _i=0; _i<4; _i++)

         {

            num = 0;

            for(int i=7; i>=0; i--)

            {

                scanf("%c",&ch);

                if(ch == '1')   

                {

                   num += pow_2[i];  

                }               

            }

            printf("%d",num);

            if(_i < 3)      printf(".");

         }

         printf("/n");    

    }

    

    return 0;

}