#1482. 整数求和
整数求和
题目描述
小青遇到了这样一个问题: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. The problem is to calculate the sum of many very large integers.
输入格式
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. The final input line will contain a single zero on a line by itself.
输出格式
Output the sum of all the VeryLongIntegers, with no leading zeros except for the value zero itself when there is no other output.
样例
样例 1
输入 # 1
12345678901234567890
98765432109876543210
0
输出 # 1
111111111011111111100