How Many Fibs? hdu1316 高精度
2013-01-31 15:48
525 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1316
大数我就用JAVA。 膜拜JAVA,JAVA无敌。
今天学会了用eclipse-java 调试。
F8跳到下一个断点,ctrl+shift+b设断点,F5、F6单步执行。
大数我就用JAVA。 膜拜JAVA,JAVA无敌。
今天学会了用eclipse-java 调试。
F8跳到下一个断点,ctrl+shift+b设断点,F5、F6单步执行。
import java.math.*; import java.util.Scanner; public class Main { public static void main(String args[]){ int N=500; BigInteger ficc[]=new BigInteger ; init(ficc); Scanner cin=new Scanner(System.in); BigInteger a,b; int i,count; while (cin.hasNext()){ a=cin.nextBigInteger(); b=cin.nextBigInteger(); count=0; if (a.compareTo(BigInteger.ZERO)==0&&b.compareTo(BigInteger.ZERO)==0) break; for (i=0;i<N;i++){ if (ficc[i].compareTo(a)!=-1&&ficc[i].compareTo(b)!=1) count++; if (ficc[i].compareTo(b)==1) break; } System.out.println(count); } cin.close(); } public static void init(BigInteger ficc[]){ int i; BigInteger ten,c; ficc[0]=new BigInteger("1"); ficc[1]=new BigInteger("2"); c=new BigInteger("1"); ten=new BigInteger("10"); for (i=0;i<101;i++) c=c.multiply(ten); i=2; while (ficc[i-1].compareTo(c)==-1){ ficc[i]=ficc[i-1].add(ficc[i-2]); i++; } } }
相关文章推荐
- hdu1316(How Many Fibs?)高精度
- Java 大数之大数高精度斐波那契 UVA_10579&&HDU1316 How many Fibs?
- POJ2413 How many Fibs?【高精度】【二分】
- JAVA hdu 1316 How Many Fibs?(高精度)
- POJ 2413 How many Fibs?(高精度暴力)
- HDU1316:How Many Fibs?
- HDU1316:How Many Fibs?(大数JAVA)
- POJ 2413 How many Fibs?(高精度)
- hdu 1316 How Many Fibs? (模拟高精度)
- How many Fibs?(高精度)
- 数论 - 高精度Fibonacci数 --- UVa 10183 : How Many Fibs ?
- HDU1316 How Many Fibs? 【大数】
- UVA - 10183 - How Many Fibs? (斐波那契 + 高精度)
- hdu1316 How Many Fibs?(大数)
- hdu 1316 How Many Fibs?(Fibonacci+高精度+二分)
- pku 2413 How many Fibs? 【java高精度】
- (高精度运算4.7.31)POJ 2413 How many Fibs?(大数累加)
- How Many Fibs? hdu1316
- How Many Fibs? 【java 处理高精度】
- 数论 - 高精度Fibonacci数 --- UVa 10183 : How Many Fibs ?