HDU 1047 Integer Inquiry -- java大法好
2016-05-02 22:31
447 查看
Integer Inquiry
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17420 Accepted Submission(s): 4507
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
import java.math.BigInteger; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); int n = cin.nextInt(); while (n-->0) { BigInteger sum = BigInteger.valueOf(0); while (cin.hasNextBigInteger()) { BigInteger a = cin.nextBigInteger(); if(!a.equals(BigInteger.valueOf(0))) sum = sum.add(a); else{ System.out.println(sum); if(n!=0){ System.out.println(); } break; } } } cin.close(); } }
相关文章推荐
- 数据选择控件-UIPickerView的总结
- UITextView文字上方一段空白的解决方法
- Break、Continue、Return区别
- 重构:Query Method
- leetcode——347——Top K Frequent Elements
- [可并堆 中位数] BZOJ 1367 [Baltic2004]sequence
- 图形用户界面(GUI)应用程序开发——菜鸟的第一步
- 重构:Replace Temp with Query
- 关于 UIImage 以及 YYImage 的内存问题与解决方案
- 深入剖析deque容器实现
- 解决:Connections could not be acquired from the underlying database!
- JDBC出现这个错误的解决办法Connections could not be acquired from the underlying database!
- poj3581 Sequence (后缀数组)
- iOS UIKit:viewController之Present (3)
- Android:通过build gradle中的buildTypes设置自动log开关(二)
- Codeforces Beta Round #11 A. Increasing Sequence
- Android:通过build gradle中的buildTypes设置自动log开关(一)
- java设计模式-Builder创建者模式
- 并发队列ConcurrentLinkedQueue和阻塞队列LinkedBlockingQueue用法
- UIDatePicker的使用