HDOJ2070 Fibbonacci Number
2017-11-06 22:57
127 查看
Fibbonacci Number
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 26638 Accepted Submission(s): 12205
[align=left]Problem Description[/align]
Your objective for this question is to develop a program which will generate a fibbonacci number. The fibbonacci function is defined as such:
f(0) = 0
f(1) = 1
f(n) = f(n-1) + f(n-2)
Your program should be able to handle values of n in the range 0 to 50.
[align=left]Input[/align]
Each test case consists of one integer n in a single line where 0≤n≤50. The input is terminated by -1.
[align=left]Output[/align]
Print out the answer in a single line for each test case.
[align=left]Sample Input[/align]
3
4
5
-1
[align=left]Sample Output[/align]
2
3
5
HintNote:
you can use 64bit integer: __int64
import java.util.Scanner; public class Main{ private static Scanner scanner; public static void main(String[] args) { scanner = new Scanner(System.in); while(scanner.hasNext()){ int n= scanner.nextInt(); if(n == -1){ break; } //打表 long arr[] = new long[51]; arr[0] = 0; arr[1] = 1; for (int i = 2; i < arr.length; i++) { arr[i] = arr[i-1]+arr[i-2]; } //输出 System.out.println(arr ); } } }
相关文章推荐
- HDOJ2070 Fibbonacci Number
- HDOJ 2070 Fibbonacci Number
- HDOJ 2070 Fibbonacci Number
- Hdoj 2070 Fibbonacci Number
- hdoj2070斐波那契数列
- hdoj 2070 Fibbonacci Number
- hdoj:2070
- HDOJ 2070 Fibbonacci Number
- HDOJ 2070 Fibbonacci Number
- POJ 1053 Integer Inquiry && HDOJ 1047 Integer Inquiry (大数加法)
- HDOJ 2011 多项式求和
- ACM--HDOJ 2024--C语言合法标识符--字符串
- hdoj1005
- [HDOJ 4966] GGS-DDU [最小树形图]
- HDOJ 题目3836 Equivalent Sets(强连通分量)
- HDOJ 1081(ZOJ 1074) To The Max(动态规划)
- hdoj2612Find a way(两次bfs)
- HDOJ 1069 Monkey and Banana
- hdoj 2993 斜率优化
- 【HDOJ】3345 War Chess