uva 424 Integer Inquiry

最新推荐文章于 2025-09-05 12:54:34 发布

SPZn_up

最新推荐文章于 2025-09-05 12:54:34 发布

阅读量540

点赞数

CC 4.0 BY-SA版权

分类专栏：高精度 ====ACM===== 文章标签： c++ uva

本文链接：https://blog.youkuaiyun.com/llx523113241/article/details/42123825

====ACM===== 同时被 2 个专栏收录

312 篇文章

订阅专栏

高精度

2 篇文章

订阅专栏

本文介绍了一个经典的编程竞赛题目UVA424 Integer Inquiry，该题要求实现高精度加法来处理非常大的整数求和问题。通过倒序存储和逐位相加的方式，有效解决了大数求和的挑战。

uva 424 Integer Inquiry

One of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers.

``This supercomputer is great,'' remarked Chip. ``I only wish Timothy were here to see these results.'' (Chip moved to a new apartment, once one became available on the third floor of the Lemon Sky apartments on Third Street.)

Input

The input will consist of at most 100 lines of text, each of which contains a single VeryLongInteger. Each VeryLongInteger will be 100 or fewer characters in length, and will only contain digits (no VeryLongInteger will be negative).

The final input line will contain a single zero on a line by itself.

Output

Your program should output the sum of the VeryLongIntegers given in the input.

Sample Input

123456789012345678901234567890
123456789012345678901234567890
123456789012345678901234567890
0

Sample Output

370370367037037036703703703670

题目大意：多个数求和，很大的数哦。

解题思路：高精度加法，注意进位，注意把字符当做数字处理要减去 '0'。

#include<stdio.h>
#include<string.h>
int main() {
	char s1[1000], s2[1000];
	char a[1000], b[1000];
	memset(s1, 0, sizeof(s1));
	memset(a, 0, sizeof(a));
	memset(b, 0, sizeof(b));
	gets(b);
	for (int i = strlen(b) - 1, j = 0; i >= 0; i--, j++) {     //倒序储存，从s[0]开始处理，更方便。
			s1[j] = b[i];
		}
	while (gets(a) != NULL && a[0] != 0) {
		memset(b, 0, sizeof(b));
		memset(s2, 0, sizeof(s2));
		int len = strlen(a);
		for (int i = len - 1, j = 0; i >= 0; i--, j++) {   //同上
			s2[j] = a[i];
		}
		if (strlen(s1) < strlen(s2)) {   //找出位数更大的数
			strcpy(b, s1);
			strcpy(s1, s2);
			strcpy(s2, b);
		}
		for (int i = 0; i < strlen(s2); i++) {     //先逐位相加
			s1[i] += s2[i] - '0';
		}	
		for (int i = 0; i < strlen(s1) - 1; i++) {   //然后大于9的位，进一
			if (s1[i] > '9') {
				s1[i] -= 10;
				s1[i+1]++;
			}
		}
	if (s1[strlen(s1) - 1] > '9') {   //处理最高位
		s1[strlen(s1) - 1] -= 10;
		s1[strlen(s1)] = '1';
	}
	}
	for (int i = strlen(s1) - 1; i >= 0; i--) {   //再倒序输出
		printf("%c", s1[i]);
	}
	printf("\n");
	return 0;
}