zoukankan      html  css  js  c++  java
  • UVA+POJ中大数实现的题目,持续更新(JAVA实现)

    UVA10494:If We Were a Child Again 大数除法加取余

    import java.util.Arrays;
    import java.util.Scanner;
    import java.math.*;
    
    public class Main
    {
        public static void main(String[] args)
        {
            Scanner cin = new Scanner(System.in);
            BigInteger a,b;
            String s;
            while(cin.hasNext())
            {
                a=cin.nextBigInteger();
                s=cin.next();
                b=cin.nextBigInteger();
                if(s.equals("/"))
                {
                    System.out.println(a.divide(b));
                }
                else if(s.equals("%"))
                {
                    System.out.println(a.mod(b));
                }
            }
            cin.close();
        }
    
    }

    UVA748&&HDU1063: Exponentiation 大数的乘法,pow

    import java.util.Arrays;
    import java.util.Scanner;
    import java.math.*;
    
    public class Main
    {
        public static void main(String[] args)
        {
            Scanner cin = new Scanner(System.in);
            BigDecimal a;
            int n;
            while(cin.hasNext())
            {
                a=cin.nextBigDecimal();
                n=cin.nextInt();
                BigDecimal cnt=a.pow(n).stripTrailingZeros();
                System.out.println( cnt.toPlainString().replaceAll("^0", "") ); 
            }
            cin.close();
        }
    
    }
  • 相关阅读:
    [武汉集训] Cliquers
    [NOI2017] 泳池
    [NOWCODER7] 小睿睿的方案
    动态dp初探
    [WC2008] 游览计划
    插头dp初探
    最小斯坦纳树初探
    2020ccpc总结
    Finding Palindromes
    最长非严格上升子序列的思考 && CF 1437E Make It Increasing
  • 原文地址:https://www.cnblogs.com/zhangmingcheng/p/4338149.html
Copyright © 2011-2022 走看看