How many Fibs?(JAVA)大数
来源:互联网 发布:何钦铭c语言第三版答案 编辑:程序博客网 时间:2024/05/22 14:03
Problem B: How many Fibs?
Recall the definition of the Fibonacci numbers:
f1 := 1Given two numbers a and b, calculate how many Fibonacci numbers are in the range [a,b].
f2 := 2
fn := fn-1 + fn-2 (n>=3)
Input Specification
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<=10100. The numbers a and b are given with no superfluous leading zeros.
Output Specification
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
题目看完,显然是高精度,C肯定可以做,不过这里给出JAVA代码。
import java.util.*;
import java.io.*;
public class Main{
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
BigInteger [] s=new BigInteger [50010];
BigInteger n,m;
BigInteger k=new BigInteger("0");
s[2]=new BigInteger ("2");
s[1]=new BigInteger ("1");
for(int i=3;i<=50000;i++)
{
s[i]=s[i-1].add(s[i-2]);
}
while(cin.hasNextBigInteger()){
int sum=0;
n=cin.nextBigInteger();
m=cin.nextBigInteger();
if(n.compareTo(k)==0&&m.compareTo(k)==0)
break;
for(int i=1;i<=50000;i++)
{
if((s[i].compareTo(n)>=0)&&(s[i].compareTo(m)<=0))
sum++;
}
System.out.println(sum);
}
}
}
唯一需要注意的是数组大小,开到10W会超时,1W会WA,大概估算开到5W就可以了。
0 0
- How many Fibs?(JAVA)大数
- How many Fibs?(java大数)
- How Many Fibs? (大数)
- HDOJ 1316 How Many Fibs?(Java大数开挂)
- hdu 1316 How Many Fibs?【JAVA大数】
- 【JAVA大数训练】How Many Fibs?
- HDU1316:How Many Fibs?(大数JAVA)
- UVA10183 - How Many Fibs?(java大数+二分)
- HDU-1316 How Many Fibs?(Java大数)
- hdu1316 How Many Fibs?(大数)
- HDU1316 How Many Fibs? 【大数】
- How Many Fibs? 大数加法
- HDU1316 How Many Fibs? 【大数】
- How many Fibs?(java)
- hdoj 1316 How Many Fibs? 【Java大数】+【打表】
- HDU 1316 How Many Fibs? java大数(水
- hdu1316 How Many Fibs? (java大数练习第二弹)
- HDU 1316 -- How Many Fibs?(Java)
- 简单地实现图像坐标的信息
- Android布局属性
- 局域网内命令集锦
- WindowResize.js
- 水池数目
- How many Fibs?(JAVA)大数
- JDK7的文件操作
- HTTP协议探索之userAgent
- 新年快乐
- FOJ 1683 纪念SlingShot
- 实现图像的矩形与轮廓
- 文章标题
- CUGB图论专场:I - Sightseeing(最短路与次短路)
- Java 7之异步I/O第5篇 - 异步I/O操作之通道