JAVA睑板....

Integer Inquiry

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

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

import java.util.*;
import java.math.*;public class Main
{public static void main(String[] args){Scanner cin= new Scanner(System.in);int n=cin.nextInt();boolean flag=false;while(n-->0){if(flag==false) flag=true;else System.out.println("");BigInteger ans=BigInteger.ZERO;while(cin.hasNextBigInteger()){BigInteger m=cin.nextBigInteger();if(m.equals(BigInteger.ZERO))break;ans=ans.add(m);}System.out.println(ans);}}
}

HDOJ 1047 Integer Inquiry相关推荐

hdu 1047 Integer Inquiry
题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=1047 Integer Inquiry Description One of the first use ...
HDU 1047 Integer Inquiry（高精度加法水）
链接:传送门思路:高精度水题 /*************************************************************************> File ...
Poj 1503 Integer Inquiry
1.链接地址: http://poj.org/problem?id=1503 2.题目: Integer Inquiry Time Limit: 1000MS Memory Limit: 1000 ...
ZOJ 1292 Integer Inquiry
https://zoj.pintia.cn/problem-sets/91827364500/problems/91827364791 题意:先输入一个数表示测试样例的个数,接着输入几个数(可以不 ...
Integer Inquiry
java大数加法 import java.io.*; import java.math.*; import java.util.*;public class Main {public static v ...
杭电OJ分类题目（1）
原题出处:HDOJ Problem Index by Type,http://acm.hdu.edu.cn/typeclass.php 杭电OJ分类题目(1) HDU Introduction HDU ...
Java Java Java
学下java 的大数该怎么用>< hdu 1023 Train Problem II 求卡特兰数诶...不记得卡特兰数的我眼泪掉下来第一次用 java 大数有点激动...> ...
POJ题目分类（按初级＼中级＼高级等分类，有助于大家根据个人情况学习）
本文来自:http://www.cppblog.com/snowshine09/archive/2011/08/02/152272.spx 多版本的POJ分类流传最广的一种分类: 初期: 一.基本算 ...
题目梳理（一）(2019.07.06~2019.07.20)
一.字典树类型 A HihoCoder1014 Trie树(已做) 题目链接 https://hihocoder.com/problemset/problem/1014 B HDU12 ...

HDOJ 1047 Integer Inquiry

Integer Inquiry

HDOJ 1047 Integer Inquiry相关推荐

最新文章

热门文章