PIPI OJ 1043: 数学王子(高精度加法+乘法+除法)Java代码

菜鸟生成记(87)

1043: 数学王子

不得不说，Java的JDK是真的强，高精度运算轻松搞定！

package OJ;

import java.math.BigInteger;
import java.util.Scanner;

public class OJ_32 {

    public static void main(String[] args) {
        Scanner cin=new Scanner(System.in);
        int t=cin.nextInt();
        while(t--!=0) {
            int n = cin.nextInt();
            method(n);
        }
    }
    static void method(int n){
        String num= "1";//10^n
        for (int i = 1; i <= n; i++)
            num+= "0";
            /*
            max=10^n,sum=0,
            sum=(1+max)*(max/2)
            if(max%2==0)
            sum+=max/2+1
             */
        BigInteger sum=new BigInteger("0");
        BigInteger max_=new BigInteger(num);
        BigInteger max_1=new BigInteger("0");
        BigInteger max_2=new BigInteger("0");
        max_2=max_.divide(new BigInteger("2"));//max/2
        max_1=max_.add(new BigInteger("1"));//max+1
        //System.out.println(max_1);
        //System.out.println(max_2);
        sum=max_1.multiply(max_2);//(1+max)*(max/2)
        if(n!=0)
            System.out.println(sum);
        else
            System.out.println(1);
    }
}