首页 > ACM题库 > HDU-杭电 > HDU 1047 Integer Inquiry-高精度-[解题报告] C++
2013
11-26

HDU 1047 Integer Inquiry-高精度-[解题报告] C++

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.)

输入:

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.

输出:

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

This problem contains multiple test cases!

The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

The output format consists of N output blocks. There is a blank line between output blocks.

样例输入:

1


123456789012345678901234567890
123456789012345678901234567890
123456789012345678901234567890
0

样例输出:

370370367037037036703703703670

题目连接:http://acm.hdu.edu.cn/showproblem.php?pid=1047


题目大意:给出测试组数,每组之间有空行,结束为“0”, 求每组给出的数字之和,输出每两组之间空行。


解题思路:处理一下空行就可以了,‘+’法套模板。

模板连接:http://blog.csdn.net/keshuai19940722/article/details/10087993

int main() {
    int cas;
    bign sum, num;
    char str[N];

    cin >> cas;
    while (cas--) {
	sum = 0;
	getchar();
	while (cin >> str ) {
	    if (strcmp(str, "0") == 0)
		break;
	    num = str;
	    sum = sum + num;
	}

	sum.put();
	cout << endl;
	if (cas)
	    cout << endl;
    }
    return 0;
}


  1. 思路二可以用一个长度为k的队列来实现,入队后判断下队尾元素的next指针是否为空,若为空,则出队指针即为所求。

  2. 有两个重复的话结果是正确的,但解法不够严谨,后面重复的覆盖掉前面的,由于题目数据限制也比较严,所以能提交通过。已更新算法