How Many Fibs_hdu_1316(大数).java
来源:互联网 发布:java date 减一个月 编辑:程序博客网 时间:2024/06/18 11:53
How Many Fibs?
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3098 Accepted Submission(s): 1232
Problem Description
Recall the definition of the Fibonacci numbers:
f1 := 1
f2 := 2
fn := fn-1 + fn-2 (n >= 3)
Given two numbers a and b, calculate how many Fibonacci numbers are in the range [a, b].
f1 := 1
f2 := 2
fn := fn-1 + fn-2 (n >= 3)
Given two numbers a and b, calculate how many Fibonacci numbers are in the range [a, b].
Input
The input contains several test cases. Each test case consists of two non-negative integer numbers a and b. Input is terminated by a = b = 0. Otherwise, a <= b <= 10^100. The numbers a and b are given with no superfluous leading zeros.
Output
For each test case output on a single line the number of Fibonacci numbers fi with a <= fi <= b.
Sample Input
10 1001234567890 98765432100 0
Sample Output
54
import java.math.BigInteger;import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner input=new Scanner(System.in);BigInteger f[]=new BigInteger[505];f[0]=BigInteger.valueOf(1);f[1]=BigInteger.valueOf(2);for(int i=2;i<502;i++){f[i]=f[i-1].add(f[i-2]);}while(true){BigInteger a=input.nextBigInteger();BigInteger b=input.nextBigInteger();if(a.equals(BigInteger.ZERO)&&b.equals(BigInteger.ZERO))break;int sum=0;for(int i=0;i<502&&b.compareTo(f[i])>=0;i++){if(f[i].compareTo(a)>=0)sum++;}System.out.println(sum);}}}
- How Many Fibs_hdu_1316(大数).java
- hdu 1316 How Many Fibs?【JAVA大数】
- How many Fibs?(JAVA)大数
- 【JAVA大数训练】How Many Fibs?
- HDU1316:How Many Fibs?(大数JAVA)
- How many Fibs?(java大数)
- UVA10183 - How Many Fibs?(java大数+二分)
- HDU-1316 How Many Fibs?(Java大数)
- How Many Fibs? (大数)
- hdoj 1316 How Many Fibs? 【Java大数】+【打表】
- HDU 1316 How Many Fibs? java大数(水
- HDOJ 1316 How Many Fibs?(Java大数开挂)
- UVA10303 - How Many Trees?(java大数+catalan数)
- hdu1316 How Many Fibs? (java大数练习第二弹)
- HDU1316 How Many Fibs? 【大数】
- How Many Fibs? 大数加法
- HDU1316 How Many Fibs? 【大数】
- POJ 2413 : How many Fibs? - JAVA大数! / 二分查找+大数加法
- 阻止操作系统进入挂起
- 协议
- Linux内核 文件一致性之主动一致性
- MySQL集群:主从数据库配置 实现查询负载
- Android技术积累:图片缓存管理
- How Many Fibs_hdu_1316(大数).java
- session修改存储机制写成类
- nginx事件模块之IO多路复用的选择
- Highcharts.js轻松做图表
- 记录一下八款开源 Android 游戏引擎
- ACM之常见的(C++版)问题解析
- 实现二------------实现Runnbale接口
- Android API——自定义组件(Custom Components)
- js中数组Array的一些常用方法。