java大数

大数阶乘：

1.题目链接：南阳理工学院训练场 点击打开链接

import java.util.*;
import java.math.*;
public class Main {
	public static void main(String [] args)
	{
		int a;
		Scanner cin = new Scanner(System.in);
		a = cin.nextInt();
		BigInteger ans = BigInteger.ONE;
		for(int i = 1; i <= a; i++)
		{
			ans = ans.multiply(BigInteger.valueOf(i));
		}
		System.out.println(ans);
	}

}

2.hdu 1042

题目链接：

N!

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 55263    Accepted Submission(s): 15708

Problem Description

Given an integer N(0 ≤ N ≤ 10000), your task is to calculate N!

 

Input

One N in one line, process to the end of file.

 

Output

For each N, output N! in one line.

 

Sample Input

  
  

   
   1
2
3
  
  

 

Sample Output

  
  

   
   1
2
6
  
  

 

import java.util.*;
import java.math.*;
public class Main {
	public static void main(String [] args)
	{
		int a;
		Scanner cin = new Scanner(System.in);
		while(cin.hasNext())
		{
			a = cin.nextInt();
		BigInteger ans = BigInteger.ONE;
		for(int i = 1; i <= a; i++)
		{
			ans = ans.multiply(BigInteger.valueOf(i));
		}
		System.out.println(ans);
		}
	}

}

3. hdu 1047

Integer Inquiry

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12981    Accepted Submission(s): 3277

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
  
  

 

import java.util.*;
import java.math.*;
public class Main {
	public static void main(String [] args)
	{
		int a;
		Scanner cin = new Scanner(System.in);
		while(cin.hasNext())
		{
			a = cin.nextInt();
			boolean flag = true;
			for(int i = 0; i < a; i++)
			{
				BigInteger zero = BigInteger.valueOf(0);
				BigInteger b, ans = BigInteger.valueOf(0);
				while(true)
				{
					b = cin.nextBigInteger();
					if(b.compareTo(zero)== 0){
						break;
					}
					else{
						ans=ans.add(b);
					}
				}
				if(i < a-1){
					System.out.println(ans);
					System.out.println();
				}
				else{
					System.out.println(ans);
				}
			}
		}
		
	}

}

4.hdu 1063

Exponentiation

Time Limit: 1000/500 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6993    Accepted Submission(s): 1986

Problem Description

Problems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is a taxing experience for many computer systems.

This problem requires that you write a program to compute the exact value of R ⁿ where R is a real number ( 0.0 < R < 99.999 ) and n is an integer such that 0 < n <= 25.

 

Input

The input will consist of a set of pairs of values for R and n. The R value will occupy columns 1 through 6, and the n value will be in columns 8 and 9.

 

Output

The output will consist of one line for each line of input giving the exact value of R^n. Leading zeros should be suppressed in the output. Insignificant trailing zeros must not be printed. Don't print the decimal point if the result is an integer.

 

Sample Input

  
  

   
   95.123 12
0.4321 20
5.1234 15
6.7592  9
98.999 10
1.0100 12
  
  

 

Sample Output

  
  

   
   548815620517731830194541.899025343415715973535967221869852721
.00000005148554641076956121994511276767154838481760200726351203835429763013462401
43992025569.928573701266488041146654993318703707511666295476720493953024
29448126.764121021618164430206909037173276672
90429072743629540498.107596019456651774561044010001
1.126825030131969720661201
  
  

 

import java.util.*;
import java.math.*;
public class Main {
    public static void main(String [] args){
        Scanner cin = new Scanner(System.in);
        while(cin.hasNextBigDecimal()){
            BigDecimal bd = cin.nextBigDecimal();
            BigDecimal ans = BigDecimal.ONE;
            int a = cin.nextInt();
            for(int i = 1; i <= a; i++){
                ans=ans.multiply(bd);
            }
            ans=ans.stripTrailingZeros();//去掉后导零
            String str=ans.toPlainString();
            if(str.startsWith("0.")){
                str=str.substring(1);//去掉0.时的0
            }
            System.out.println(str);
        }
    }
}

5.hdu 1316

How Many Fibs?

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4389    Accepted Submission(s): 1723

Problem Description

Recall the definition of the Fibonacci numbers:
f1 := 1
f2 := 2
fn := fn-1 + fn-2 (n >= 3)

Given two numbers a and b, calculate how many Fibonacci numbers are in the range [a, b].

 

Input

The input contains several test cases. Each test case consists of two non-negative integer numbers a and b. Input is terminated by a = b = 0. Otherwise, a <= b <= 10^100. The numbers a and b are given with no superfluous leading zeros.

 

Output

For each test case output on a single line the number of Fibonacci numbers fi with a <= fi <= b.

 

Sample Input

  
  

   
   10 100
1234567890 9876543210
0 0
  
  

 

Sample Output

  
  

   
   5
4
  
  

<span style="font-size:12px;">import java.util.*;
import java.math.*;
public class Main{
	public static void main(String [] args){
		Scanner cin = new Scanner(System.in);
		BigInteger zero = BigInteger.ZERO;
		BigInteger ba ,bb;
		while(cin.hasNextBigInteger()){
			ba = cin.nextBigInteger();
			bb = cin.nextBigInteger();
			if(ba.compareTo(zero) == 0 && bb.compareTo(zero) == 0){
				break;
			}
			int cnt = 0;
			BigInteger a = new BigInteger("0");
			BigInteger b = new BigInteger("1");
			for(int i = 1; true; i++){
				a=a.add(b);
				b=b.add(a);
				if((a.compareTo(ba) >= 0 && a.compareTo(bb) <= 0)||(b.compareTo(ba) >= 0 && b.compareTo(bb) <= 0)){
					cnt++;
					if((a.compareTo(ba) >= 0 && a.compareTo(bb) <= 0)&&(b.compareTo(ba) >= 0 && b.compareTo(bb) <= 0)){
						cnt++;
					}
				}
				if(a.compareTo(ba) >= 0 && b.compareTo(bb) >= 0){
					break;
				}
			}
			System.out.println(cnt);
		}
	}
}</span>