OJ Board

I don't go through Onko's source code but I use the same method to Onko's. I *sort* the array and find if I compare words with long lenth first, then there are much less recursion than short length. Try sort when your think your speed is not good enoght. There are often miracles happen:)

Finally I got Accept

Here are some cases I failed to consider.

Input
3
1 1 -1 -1 3 3
1 1 -3 -2 3 3
1 1 -5 -1 3 3

Output
Case 1: 0
Case 2: 1
Case 3: 1

Some input and the output of my program.

4
-1000 1000 -1000 1000 1 1000
-1000 1000 -1000 1000 1 1
-1000 1000 -1000 1000 1 2
-1000 0 -1000 0 1 1000

Output
Case 1: 43813896
Case 2: 4004001
Case 3: 8008002
Case 4: 11459448

From the accept ratio, it seems this problem is easy.
But unfortunately, I still get Wrong Answer after several attempts.

Could someone provide some corner cases that we often ignore?

Besides, I have some assumptions, but don't know if it's always true.

1.About the input, assume the 3 pairs of ...

Hi javier lira,

You can try a case with aaaaa.....(repeat 10000 times)
or try a case with aaaaa...(5000 times)...bbbbb...(5000 times).

Remember that you don't need to scan from left to right for the start point with step 1 always.

If there are matches more than one characters, you can move to ...

Hi Sohel,

Below is what I consider in this program. For your reference.

a. Don't take care of +/-. Even there are + or - symbol, the result should be the same.

b.Take care of white space, tab. In fact. this kind of characters are ALL
skipped.

c.Check invalid character for certain base. For ...

Bobi,
1. You can try to allocate the array dynamically. I use the C function
malloc and realloc and free to do all thing.

2.The last forest ends with EOF, not %. But for output, you shold print
a % after the last input.

3.I onlly deal with rectangle matrix. So I guess the number of letter
in ...

Note pawn doesn't attack piece in front of it. It attacks piece in left/right
front of it.