HDU 2070 JAVA
来源:互联网 发布:2008年网络流行歌曲 编辑:程序博客网 时间:2024/06/05 14:54
Problem Description
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.
Input
Each test case consists of one integer n in a single line where 0≤n≤50. The input is terminated by -1.
Output
Print out the answer in a single line for each test case.
Sample Input
3
4
5
-1
Sample Output
2
3
5
import java.util.Scanner;//Wrong Answerpublic class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(sc.hasNext()){ long a[]=new long [100]; for(int i=2;i<a.length;i++){ a[0]=0;a[1]=1; a[i]=a[i-1]+a[i-2]; } int n = sc .nextInt(); if(n==-1){ break; } System.out.println(a[n]); } }}
0 0
- HDU 2070 JAVA
- hdu acm hdu 2115 Java
- Exponentiation hdu 1063 java
- hdu 1313 (Java)
- 【Java】hdu 4043
- hdu 1242 Rescue<java>
- HDU 1002 JAVA
- hdu 2092(java)
- hdu 1063 java 高精度
- hdu 1106(java)
- hdu 1073(java)
- HDU-4762 Java高精度
- hdu 1002 java
- hdu 1089 java
- JAVA hdu 2192 MagicBuilding
- hdu 1001 java
- hdu 1002 java
- hdu 1003 java
- android五大基本存储方式
- BZOJ 2330: [SCOI2011]糖果
- POJ 3764 The xor-longest Path (Trie树 + dfs)
- 客户端的跳转与服务器端的跳转的区别
- C++之“this指针”
- HDU 2070 JAVA
- caffe学习笔记3-matcaffe接口学习
- sdutacm-大家快来A水题
- Android逆向笔记之AndroidKiller与Android Studio的使用
- POJ 2342 树形dp
- HDU 2071 JAVA
- Java中常用的类型转换汇总
- 实例:sizeof一个指针或者一个数组
- 新搭建后台server服务? oh no!------程序员的脑力劳动和体力劳动