zoukankan      html  css  js  c++  java
  • hdu 1047 大数加法 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 }
  • 相关阅读:
    e.printStackTrace()打印在哪里以及如何e.printStackTrace()的内容打印在日志中
    oracle分组并在组内排序
    Java.util.Calendar类
    oracle分页查询
    两个map合并
    【自动化测试】无需图形界面环境下的浏览器开源项目
    【运维工具】logrotate 日志管理神器
    如何查看google chrome 插件源码
    phpexcel 读取数据
    常用开发资源收集
  • 原文地址:https://www.cnblogs.com/Xycdada/p/6526260.html
Copyright © 2011-2022 走看看