标签:java acm biginteger
10 100 1234567890 9876543210 0 0
5 4给出一个范围[l,r],求此范围内的斐波那契数的个数。打表即可。import java.io.*; import java.util.*; import java.math.*; public class Main { public static void main(String[] args){ Scanner in=new Scanner(System.in); BigInteger a,b,cnt;BigInteger[] f=new BigInteger[10010]; f[1]=BigInteger.valueOf(1);f[2]=BigInteger.valueOf(2); for(int i=3;i<10005;i++) f[i]=f[i-1].add(f[i-2]); while(in.hasNext()){ cnt=BigInteger.ZERO; a=in.nextBigInteger();b=in.nextBigInteger(); if(a.equals(BigInteger.valueOf(0))&&b.equals(BigInteger.valueOf(0)))break; for(int i=1;i<10000;i++) if((f[i].compareTo(a)==0||f[i].compareTo(a)==1)&&(f[i].compareTo(b)==0||f[i].compareTo(b)==-1)) cnt=cnt.add(BigInteger.valueOf(1)); System.out.println(cnt); } } }
标签:java acm biginteger
原文地址:http://blog.csdn.net/qq_16255321/article/details/39299509