POJ 1503 Integer Inquiry

最新推荐文章于 2020-10-03 14:01:55 发布

原创最新推荐文章于 2020-10-03 14:01:55 发布 · 526 阅读

0 ·

CC 4.0 BY-SA版权

-----JAVA 同时被 2 个专栏收录

10 篇文章

订阅专栏

|--POJ

9 篇文章

订阅专栏

本文介绍POJ 1503 IntegerInquiry题目要求及解决方案，涉及大数运算处理多个非常大的整数相加的问题。通过Java的BigInteger类实现输入输出。

http://poj.org/problem?id=1503

Integer Inquiry

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 32089		Accepted: 12535

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

//:poj1503 Integer Inquiry
import java.math.BigInteger;
import java.util.Scanner;
public class poj1503 {
	public static void main(String[] args)
	{
		Scanner input=new Scanner(System.in);
		
		BigInteger n,sum;
		n=BigInteger.valueOf(100);
		sum=BigInteger.valueOf(0);
		while(true)
		{
			if(n.equals(BigInteger.ZERO)) break;
			n=input.nextBigInteger();
			sum=sum.add(n);
			
		}
		System.out.println(sum);
		input.close();
	}
}///:~