关闭

九度oj-1119-Integer Inquiry

标签: 九度
246人阅读 评论(0) 收藏 举报
分类:

时间限制:1 秒

内存限制:32 兆

特殊判题:

提交:682

解决:360

题目描述:

    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.

样例输入:
123456789012345678901234567890
123456789012345678901234567890
123456789012345678901234567890
0
样例输出:
370370367037037036703703703670
import java.util.Scanner;
import java.math.BigInteger;

public class Main{	
	public static void main(String[] args){
		Scanner in=new Scanner(System.in);
		BigInteger a=BigInteger.ZERO,b;
		while(in.hasNext()){
			b=in.nextBigInteger();
			if(b.equals(BigInteger.ZERO)) break;
			a=a.add(b);
		}
		System.out.println(a);
		in.close();
	}
}


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:227765次
    • 积分:8013
    • 等级:
    • 排名:第2646名
    • 原创:596篇
    • 转载:55篇
    • 译文:0篇
    • 评论:5条
    最新评论