POJ 1503 Integer Inquiry【大数相加 java】

最新推荐文章于 2021-11-26 09:12:52 发布

原创最新推荐文章于 2021-11-26 09:12:52 发布 · 1.3k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

acm 解题报告同时被 3 个专栏收录

185 篇文章

订阅专栏

POJ

76 篇文章

订阅专栏

java学习

9 篇文章

订阅专栏

本文介绍了一个使用Java实现的大数求和问题，利用BigInteger类处理多位数的加法运算。通过对输入的一系列非常长的整数进行累加，展示了如何有效处理大数运算，并给出了完整的代码示例。

Integer Inquiry

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 26642		Accepted: 10325

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 VeryLongIntegers given in the input.

Sample Input

123456789012345678901234567890
123456789012345678901234567890
123456789012345678901234567890
0

Sample Output

370370367037037036703703703670

Source

East Central North America 1996

1503

Accepted

3328K

688MS

Java

461B

2013-05-10 02:23:25

import java.util.Scanner;
import java.io.*;
import java.math.*;

public class Main {
	public static void main(String args[]) {
		Scanner cin = new Scanner(new BufferedInputStream(System.in));
		
		BigInteger a;
		BigInteger b = new BigInteger("0");
		BigInteger c = new BigInteger("0");
		while(cin.hasNextBigInteger()) {
			a = cin.nextBigInteger();
			if(a.compareTo(c) == 0) break;
			
			b = b.add(a); 
		}
		System.out.println(b);
	}
}