提比的强行AC

ExponentiationTime Limit: 500MS Memory Limit: 10000KTotal Submissions: 132745 Accepted: 32433DescriptionProblems involving the computation of exact values of ve

Problem CIf We Were a Child AgainInput: standard inputOutput: standard outputTime Limit: 7 seconds “Oooooooooooooooh!If I could do the easy mathematics like my school days!!I c

Product The ProblemThe problem is to multiply two integers X, Y. (0250)The InputThe input will consist of a set of pairs of lines. Each line in pair contains one multiplyer.The

Distinct SubsequencesInput: standard inputOutput: standard output A subsequence of a given sequence is just the given sequence with some elements (possibly none) left out. Formally, given a se

题意：在L-R的范围内有多少斐波那契数。思路：大数加法，然后挨个找即可。AC代码如下：import java.math.BigInteger;import java.util.Scanner;public class Main { public static void main(String [] args) { Scanner scan=new Scanner(Sy