ZOJ Problem Set - 2482 IP Address

最新推荐文章于 2023-07-06 14:40:29 发布

PX-C

最新推荐文章于 2023-07-06 14:40:29 发布

阅读量306

点赞数

CC 4.0 BY-SA版权

分类专栏：基础算法-----字符和字符串

本文链接：https://blog.csdn.net/Wchenchen0/article/details/81777974

基础算法-----字符和字符串专栏收录该内容

23 篇文章

订阅专栏

本文介绍了一种将32位二进制数转换为IPv4地址的方法，并提供了一个简单的C++实现。通过将二进制序列分组并转换为十进制数，程序能够有效地解析出标准的点分十进制格式。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

签到题，可以分成四个部分来计算

#include<iostream>
#include<set>
#include<algorithm>
#include<string>
#include<cmath>
#include<iostream>
using namespace std;

int main()
{
	int T;
	cin >> T;
	while (T--) {
		string s;
		cin >> s;
		string s1(s, 0, 8);
		string s2(s, 8, 8);
		string s3(s, 16, 8);
		string s4(s,24, 8);
		int sum1 = 0;
		reverse(s1.begin(), s1.end());

		
		for (int i = 0;s1[i];i++) {
			if (s1[i] == '1') sum1 += pow(2, i);
		}
		
		cout <<sum1 << ".";


		int sum2 = 0;
		reverse(s2.begin(), s2.end());
		for (int i = 0;s2[i];i++) {
			if (s2[i] == '1') sum2 += pow(2, i);
		}
		cout << sum2 << ".";


		int sum3 = 0;
		reverse(s3.begin(), s3.end());
		for (int i = 0;s3[i];i++) {
			if (s3[i] == '1') sum3 += pow(2, i);
		}
		cout << sum3 << ".";


		int sum4 = 0;
		reverse(s4.begin(), s4.end());
		int flag = 2;
		for (int i = 0;s4[i];i++) {
			if (s4[i] == '1') sum4 += pow(2, i);
		}
		cout << sum4 << endl;
	}
	
	return 0;
}