hdu 1250 Hat's Fibonacci
来源:互联网 发布:厦门4g网络覆盖 编辑:程序博客网 时间:2024/03/29 00:10
Hat's Fibonacci
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5590 Accepted Submission(s): 1866
Problem Description
A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1.
F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n - 1) + F(n-2) + F(n-3) + F(n-4)
Your task is to take a number as input, and print that Fibonacci number.
F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n - 1) + F(n-2) + F(n-3) + F(n-4)
Your task is to take a number as input, and print that Fibonacci number.
Input
Each line will contain an integers. Process to end of file.
Output
For each case, output the result in a line.
Sample Input
100
Sample Output
4203968145672990846840663646Note:No generated Fibonacci number in excess of 2005 digits will be in the test data, ie. F(20) = 66526 has 5 digits.
import java.math.BigInteger;import java.util.Scanner;public class Main{/* * n<7040 */public static void main(String[] args) {Scanner input=new Scanner(System.in);//F f[]=new F[10000000];7040BigInteger f[]=new BigInteger[8];while(input.hasNext()){f[1]=BigInteger.valueOf(1);f[2]=BigInteger.valueOf(1);f[3]=BigInteger.valueOf(1);f[4]=BigInteger.valueOf(1);int n=input.nextInt();if(n<=4){System.out.println(f[n]);}else {for(int i=5;i<=n;i++){f[5]=f[1].add(f[2].add(f[3].add(f[4])));f[1]=f[2];f[2]=f[3];f[3]=f[4];f[4]=f[5];}System.out.println(f[5].toString());}}}}
- hdu 1250 Hat's Fibonacci
- HDU 1250 Hat's Fibonacci
- Hdu 1250 Hat's Fibonacci
- hdu 1250 Hat's Fibonacci
- HDU 1250-Hat's Fibonacci
- hdu 1250 Hat's Fibonacci
- hdu-1250-Hat's Fibonacci
- Hdu---Hat's Fibonacci---1250
- hdu 1250 Hat's Fibonacci
- hdu 1250 Hat's Fibonacci
- hdu 1250 Hat's Fibonacci
- hdu 1250 Hat's Fibonacci
- HDU 1250: Hat's Fibonacci
- hdu 1250 Hat's Fibonacci
- hdu 1250 Hat's Fibonacci
- hdu-1250-Hat's Fibonacci
- HDU 1250 Hat's Fibonacci
- HDU 1250 Hat's Fibonacci
- 黑马程序员--Java基础加强--04.代码简化 书写规律III_数组参数【重载】【数组】【可变参数数组】【泛型可变参数数组】【个人总结】
- UVa10102 - The path in the colored field
- 可变参数
- RAID磁盘阵列详解
- java常用类解析二:IO系统输入输出类
- hdu 1250 Hat's Fibonacci
- code convention
- java常用类解析一:System类、Object类、Arrays类、Cloneable接口
- linux下解决emacs的backspace键变成了ctrl+h (C+h)键?
- Oracle 操作
- 设计模式---适配器模式
- 中位数------求数组中第i小的元素
- UVA 537 Artificial Intelligence?
- 算法的力量