poj1047(高精度加)
来源:互联网 发布:echarts china.js下载 编辑:程序博客网 时间:2024/06/03 16:59
Integer Inquiry
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8840 Accepted Submission(s): 2255
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.)
``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.
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.
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
11234567890123456789012345678901234567890123456789012345678901234567890123456789012345678900
Sample Output
370370367037037036703703703670
Source
East Central North America 1996
import java.util.*;import java.math.*;public class Main{public static void main(String[] args){Scanner cin = new Scanner(System.in);BigInteger ans = BigInteger.ZERO;while(cin.hasNext()){ans = ans.add(cin.nextBigInteger());}System.out.println(ans);}}
- poj1047(高精度加)
- poj1047 高精度
- POJ1047 Round and Round We Go【高精度】
- poj1047
- poj1047
- poj1047
- poj1047
- POJ1047
- 高精度乘以单精度 Round and Round We Go poj1047
- 【高精度 加】
- 高精度 加 减 乘
- 高精度加,减法算法
- [复习]高精度 高精度加/减/乘/除法
- poj1047 数论
- 高精度加、减、乘法运算
- 高精度加、减、乘法运算
- [模板]高精度加、减、乘
- 计蒜客 加一 (高精度)
- 棋盘(A*)
- LA 4670 Dominating Patterns
- Android单击返回键两次退出
- 算法_俄罗斯农夫法的乘法算法
- mplayer 配置文件 示例
- poj1047(高精度加)
- inputStream总结
- libcurl资料
- C# asp不能拉按钮或者双击空白地方提示未能完成该操作
- java.ByteArrayInputStream与ByteArrayOutputStream理解
- Multi-Thread Programming Resources for Game Engine
- C# 获取文件名及扩展名
- sift(C语言)VS2010中移植
- http