HDU-1047-Integer Inquiry(Java大数水题 && 格式恶心)
2015-06-10 12:01
549 查看
Integer Inquiry
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14886 Accepted Submission(s): 3811
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
East Central North America 1996
Recommend
We have carefully selected several similar problems for you: 1063 1316 1715 1753 1018
主要意思是求三个大数的和,但是要知道首先输入的第一个数n表示测试的组数,也就是每组的空行数,每个块之间要空一行!
然后最后一行不要空行,此题就很简单了!
import java.math.BigInteger; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner input = new Scanner(System.in); int n = input.nextInt(); while (n-- > 0) { BigInteger b = new BigInteger("0"); while (input.hasNextBigInteger()) { BigInteger c = new BigInteger("0"); c = input.nextBigInteger(); if (!c.equals(BigInteger.valueOf(0))) { b = b.add(c); } else { System.out.println(b); if (n != 0) { System.out.println(); } break; } } } input.close(); } }
相关文章推荐
- clCreateCommandQueue': was declared deprecated
- Universal Fighting Game Guide: Understanding Combo Systems Part 1 – The Elements
- UI控件问题和XCode编译警告和错误解决方法集锦 (持续更新ing)
- 多线程-NSOperationQueue
- ugui和ngui随手记
- UIStepper
- IOS中Key-Value Coding (KVC)的使用详解
- Unique Paths I,II
- Bluetooth--- android 蓝牙通信编程
- 全向移动平台android版手机控制器——UI界面设计
- 用好hook_views_query_alter,高度自定义view的筛选功能
- cakephp 的query方法,直接写在controller中是否 有点不合适
- 一些平台无关的整型类型,int8_t,uint8_t....
- GCD学习笔记(一):Dispatch Queue
- easyui dialog“缓存问题”
- string 和StringBuffer StringBuilder的区别
- WUI 前端组件
- 处理【Fatal error: Can't use function return value in write context 】的情况之《empty的解析》
- easyui的自动分页表格以及行编辑模式edatagrid
- UIView的setNeedsLayout, layoutIfNeeded 和 layoutSubviews 方法之间的关系解释