zoukankan      html  css  js  c++  java
  • poj-1503-java大数相加

    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.

    Sample Input

    123456789012345678901234567890
    123456789012345678901234567890
    123456789012345678901234567890
    0

    Sample Output

    370370367037037036703703703670
    第一道java题,好开森;
    import java.util.*; import java.math.*; import java.io.*; public class Main{        //外面的Main必须大写! public static void main(String[] args){ //String S大写 Scanner cin= new Scanner(System.in); BigDecimal a=BigDecimal.valueOf(0); //组合的函数名一般后个一定得大写: BigInter BigDecimal valueOf(这前不大写) hasNext nextLine; BigDecimal b=BigDecimal.valueOf(0); //赋初值 String str; while(cin.hasNext())     //相当于!=EOF { str=cin.nextLine(); //下一行输入nextLine if(str.equals("0")) //equals { break; } else { a=new BigDecimal(str); //强制转化,把str转化成大数 b=b.add(a);     //b+a; } } System.out.println(b.toPlainString()); //println,是LN
                            //toPlainString 以字符形式输出 } }

      

  • 相关阅读:
    Java的Regex --正则表达式
    Java的包装类
    类的始祖Object
    abstract和interface关键字介绍
    内部类
    Accumulation Degree [换根dp,二次扫描]
    牛客练习赛61 [口胡]
    CF1334G Substring Search [bitset,乱搞]
    CF1175F The Number of Subpermutations [哈希,乱搞]
    CF793G Oleg and chess [线段树优化建边,扫描线,最大流]
  • 原文地址:https://www.cnblogs.com/jin-nuo/p/5317286.html
Copyright © 2011-2022 走看看