How Many Fibs?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2814Accepted Submission(s): 1112Problem DescriptionRecall the definition of the Fibonacci numbers:f1 := 1f2 := 2fn := fn-1 + fn-2 (n >= 3)Given two numbers a and b, calculate how many Read More
A == B ?Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 47896Accepted Submission(s): 7324Problem DescriptionGive you two numbers A and B, if A is equal to B, you should print "YES", or print "NO".Inputeach test case contains two Read More
求高精度幂Time Limit:500MSMemory Limit:10000KTotal Submissions:117394Accepted:28569Description对数值很大、精度很高的数进行高精度计算是一类十分常见的问题。比如，对国债进行计算就是属于这类问题。现在要你解决的问题是：对一个实数R( 0.0 < R < 99.999 )，要求写程序精确计算 R 的 n 次方(Rn)，其中n 是整数并且 0 < n <= 25。InputT输入包括多组 R 和 n。 R 的值占第 1 到第 6 列，n 的值占第 8 和第 9 列。Output对于每组输入，要求 Read More
Integer InquiryTime Limit:1000MSMemory Limit:10000KTotal Submissions:26642Accepted:10325DescriptionOne of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers.``This superco Read More
ACM中java的使用这里指的java速成，只限于java语法，包括输入输出，运算处理，字符串和高精度的处理，进制之间的转换等，能解决OJ上的一些高精度题目。1.输入：格式为：Scannercin=newScanner(newBufferedInputStream(System.in));例程：importjava.io.*;importjava.math.*;importjava.util.*;importjava.text.*;publicclassMain{publicstaticvoidmain(String[]args){Scannercin=newScanner(newBuffer Read More