hdu 1047 大数加法 java大法好啊

本文详细介绍了使用Java的BigInteger类解决大数运算的问题,通过一个具体的问题实例,展示了如何读取多行大数输入并计算它们的总和。此外,还提供了一段完整的Java代码示例,帮助读者理解和应用。

Integer Inquiry

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 19879    Accepted Submission(s): 5254


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


This problem contains multiple test cases!

The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

The output format consists of N output blocks. There is a blank line between output blocks.
 

 

Sample Input
1 123456789012345678901234567890 123456789012345678901234567890 123456789012345678901234567890 0
 

 

Sample Output
370370367037037036703703703670
 

 

Source
 

 弱鸡刚接触java,才发现java有这么好的东西,cry

 1 import java.math.BigInteger;
 2 import java.util.Scanner;
 3 class Main{
 4     public static void main(String[] args) {
 5         Scanner sc=new Scanner(System.in);
 6         while(sc.hasNext()){
 7             int n;
 8             n = sc.nextInt();
 9             while((n--)!=0){
10                 BigInteger a;
11                 a = sc.nextBigInteger();
12                 BigInteger sum = a;
13                 while(!a.equals(BigInteger.ZERO)){
14                     a = sc.nextBigInteger();
15                     sum = sum.add(a);
16                 }
17                 System.out.println(sum);
18                 if(n!=0)
19                     System.out.println();
20             }
21         }
22         
23     }
24         
25 }

 

转载于:https://www.cnblogs.com/Xycdada/p/6526260.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值