Java高精度练习 Hdu 1002+1042+1047+1212+1316+1715+1753+2054

最新推荐文章于 2020-09-16 12:24:45 发布

原创最新推荐文章于 2020-09-16 12:24:45 发布 · 1k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#java #高精度

java及高精度专栏收录该内容

7 篇文章

订阅专栏

本文提供多个使用Java解决大数运算问题的示例代码，包括加法、乘法、阶乘、模运算等，通过具体题目展示了如何利用BigInteger和BigDecimal类进行高效准确的计算。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Hdu 1002 A + B Problem II

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

public class Main
{
    public static void main (String[] args)
    {
        Scanner cin = new Scanner(System.in);
        int T=cin.nextInt();
        for (int Cas=1;Cas<=T;Cas++)
        {
            BigInteger a,b;  
            a=cin.nextBigInteger();  
            b=cin.nextBigInteger();  
            System.out.println("Case "+Cas+":");  
            System.out.println(a+" + "+b+" = "+a.add(b));
            if (Cas<T)  
                System.out.println(); 
        }
        cin .close();
    }
}

Hdu 1042 N!

import java.math.*;
import java.util.*;

public class Main
{
    public static void main (String[] args)
    {
        Scanner cin = new Scanner(System.in);
        while (cin.hasNext())
        {
            int n=cin.nextInt();
            if (n==0) System.out.println("1");
            else
            {
                BigInteger ans=BigInteger.ONE;
                for (int i=1;i<=n;i++)
                {
                    ans=ans.multiply(BigInteger.valueOf(i));
                }
                System.out.println(ans);
            }
            
        }
        cin .close();//输入关闭
    }
}

Hdu 1047 Integer Inquiry

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

public class Main
{
    public static void main (String[] args)
    {
        Scanner cin = new Scanner(System.in);
        int T=cin.nextInt();
        for (int Cas=1;Cas<=T;Cas++)
        {
            boolean flag=true;
            BigInteger ans=BigInteger.ZERO,tmp;
            while (flag)
            {
                tmp=cin.nextBigInteger();  
                if (tmp.compareTo(BigInteger.valueOf(0))==0)
                    flag=false;  
                ans=ans.add(tmp);  
            }  
            System.out.println(ans);  
            if (Cas<T)
                System.out.println();
        }
        cin .close();
    }
}

Hdu 1212 Big Number

import java.util.Scanner;
import java.math.*;
public class Main
{
	public static void main (String args[])
	{
		Scanner cin=new Scanner (System.in);
		while (cin.hasNext())
		{
			BigInteger a=cin.nextBigInteger();
			BigInteger b=cin.nextBigInteger();
			System.out.println(a.mod(b));
		}
	}
}

Hdu 1316 How Many Fibs?

import java.util.Scanner;
import java.math.*;

public class Main
{
	public static void main (String args[])
	{
		Scanner cin=new Scanner (System.in);
		BigInteger []fib=new BigInteger [500];
		fib[0]=BigInteger.valueOf(1);
		fib[1]=BigInteger.valueOf(1);
		for (int i=2;i<500;i++)
			fib[i]=fib[i-1].add(fib[i-2]);
		BigInteger a,b,zero;
		zero=BigInteger.valueOf(0);
		while (cin.hasNext())
		{
			a=cin.nextBigInteger();
			b=cin.nextBigInteger();
			if (a.compareTo(zero)==0 && b.compareTo(zero)==0)
				break;
			int ans=0;
			for (int i=1;i<500;i++)
				if (fib[i].compareTo(a)>=0 && fib[i].compareTo(b)<=0)
					ans++;
			System.out.println(ans);
		}
	}
}

Hdu 1715 大菲波数

import java.util.Scanner;
import java.math.*;

public class Main
{
	public static void main (String args[])
	{
		Scanner cin=new Scanner (System.in);
		BigInteger []fib=new BigInteger [1001];
		fib[1]=BigInteger.valueOf(1);
		fib[2]=BigInteger.valueOf(1);
		for (int i=3;i<1001;i++)
			fib[i]=fib[i-1].add(fib[i-2]);
		int T=cin.nextInt();
		for (int Cas=1;Cas<=T;Cas++)
		{
			int tmp=cin.nextInt();
			System.out.println(fib[tmp]);
		}
	}
}

Hdu 1753 大明A+B

import java.util.Scanner;
import java.math.*;

public class Main
{
	public static void main (String args[])
	{
		Scanner cin=new Scanner (System.in);
		while (cin.hasNext())
		{
			BigDecimal a=cin.nextBigDecimal();
			BigDecimal b=cin.nextBigDecimal();
			a=a.add(b);
			a=a.stripTrailingZeros();  //去尾0
			String pre=a.toPlainString();  //转化成字符串，避免科学计数法
			System.out.println(pre);
		}
	}
}

Hdu 2054 A == B ?

import java.util.Scanner;
import java.math.*;

public class Main
{
    public static void main (String args[])
    {
        Scanner cin=new Scanner (System.in);
        BigDecimal a,b;
        while (cin.hasNext())
        {
            a=cin.nextBigDecimal();
            b=cin.nextBigDecimal();
            if (b.compareTo(a)==0)
                System.out.println("YES");
            else
                System.out.println("NO");
        }
    }
}