Integer Inquiry

该博客介绍了如何解决大数相加的问题。用户Chip Diller使用新的超级计算机探索了3的幂次并进行不同数目的求和。输入包含不超过100行的大整数,输出为这些整数的和。解题方法涉及将大数存储在数组中,逆序处理并考虑进位和前导零。
摘要由CSDN通过智能技术生成

Problem Description

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

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值