OJ Board

Hello.
I try to solve this problem, but always got WA.

In this problem, if n =1, then l and r should be 1.
But I write a program to test this condition, and I got an unanticipated result.

Following is my test program:

int _t = in.nextInt();
for (int _l = 0; _l < _t; _l++) {
int n = in.nextInt ...

Hi.
Finally, I was solved this problem.
I was misunderstanding Ivan said, try to calculate the "count" of "from i consecutive games you get no more than j consecutive wins",
but what we need is the "probability".

Thanks.

Hello.
I solved this problem just a moment ago.

I noticed that the problem said:
Write a program that takes two valid Fibinary numbers and prints the sum in Fibinary form. These numbers will have at most 100 digits.

I consider it means the sum of two values is at most 100 digits at first, but ...

Hello.
I am trying to solve this problem.
I already used DP to calculate the number of "from i consecutive games you get no more than j consecutive wins", just like Ivan said.
But I still confused how to derive the correct answer from this DP table.

My biggest problem is, for example i=3 and j=1 ...

If you are using Java and keep getting WA, you might want to try using C/C++. At first I converted the program in the 1st thread into a Java program. I also took the suggestion in the 2nd thread and converted the 6 loops into a single loop. However that got me WA whether I use Math.log10 or Math ...