hdu 1250 Hat's Fibonacci(java大数)
来源:互联网 发布:郑州中学编程培训班 编辑:程序博客网 时间:2024/04/30 07:29
点击打开题目链接
Hat's Fibonacci
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7407 Accepted Submission(s): 2414
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.
用Java写的Fibonacci 数组。
代码:
import java.math.*;import java.util.*;public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Integer n,i,N = 9001; BigInteger []f = new BigInteger[N]; f[1] = f[2] = f[3] = f[4] = BigInteger.valueOf(1); for(i = 5; i < N; ++i) f[i] = f[i-1].add(f[i-2]).add(f[i-3]).add(f[i-4]); Scanner cin = new Scanner(System.in); while(cin.hasNext()){ n = cin.nextInt(); System.out.println(f[n]); //System.out.println(f[n].toString().length()); } cin.close(); }}
0 0
- hdu 1250 Hat's Fibonacci(java大数)
- HDU 1250 Hat's Fibonacci (JAVA大数)
- HDU 1250 Hat's Fibonacci JAVA大数
- HDU 1250 Hat's Fibonacci(Java大数相加)+讲解
- hdu 1250 Hat's Fibonacci (Java大数)
- 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 1250Hat's Fibonacci(两种方法处理大数)
- HDU 1250 Hat's Fibonacci 大数加法 进位10000000
- HDU 1250 Hat's Fibonacci(递推+大数加法)
- HDU 1250 Hat's Fibonacci(大数相加)
- HDOJ/HDU 1250 Hat's Fibonacci(大数~斐波拉契)
- java 格式化当前日期有误
- Unix网络编程之环境搭建
- linux的mmc_spi学习笔记1
- POJ 3026 Borg Maze(BFS+Prim)
- 炒汇新手应该从错误中吸取经验
- hdu 1250 Hat's Fibonacci(java大数)
- 杭电2639————DP之01背包第k优解
- Linux 设备驱动模型中的class(类)
- acm-poj1088滑雪(记忆化搜索)
- 手机已经root了,但是在adb shell之后,输入su提示permission denied
- js 阻断网页选中和右键
- linux内核部件分析(十)——设备驱动模型之class
- 淘宝API学习之道:淘宝TOP之API接口接入教程
- 散户做外汇买卖怎样稳定的获利