HDU 1250 Hat's Fibonacci（Java大数相加）+讲解

标签：hdu   java   数学   大数相加   

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1250

100

4203968145672990846840663646


Note:
No generated Fibonacci number in excess of 2005 digits will be in the test data, ie. F(20) = 66526 has 5 digits.

直接用java大数解决即可！

代码如下：

import java.math.BigInteger;  
import java.util.*;  
//import java.io.*; 
public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner cin = new Scanner(System.in);     
        BigInteger num[] = new BigInteger[10017];
        num[1] = new BigInteger("1");
        num[2] = new BigInteger("1");
        num[3] = new BigInteger("1");
        num[4] = new BigInteger("1");
        for(int i = 5; i <= 10000; i++)
        {
        	num[i] = num[i-1].add(num[i-2].add(num[i-3].add(num[i-4])));
        }
        while(cin.hasNext())
        {
        	int n = cin.nextInt();
        	System.out.println(num[n]);
        }
	}

}

飘过的小牛：（Java类大数练手）

一个人の旅行：（Java大数处理)

From A Start,As An ACMer:(JAVA之BigInteger)

HDU 1250 Hat's Fibonacci（Java大数相加）+讲解

标签：hdu   java   数学   大数相加   

原文地址：http://blog.csdn.net/u012860063/article/details/39031735