OJ Board

hmmm.... so I give up!

Hi all,

I've been trying to solve the Get Chordered problem, with no success.

After some "googleing", I found an answer to this problem, and compared the output produced by my program with the other one. For my surprise, I found these two lines were different:

***** My program
cb Eb Gb is a B ...

Big arrays MUST be global. If you declare them locally you'll use the stack and will probably have problems.

Rafael Cotta

Well, this one Pedro Demasi teach me. Maybe I am forgetting something on the way, but that's the main idea..

Consider the linear case. You can find the greatest value on a submatrix in the following way:

1. The best you can get on the first position, is its own value
2. Go right. If what you had ...

Adrian Kuegel wrote:Each letter must be decoded uniquely, that means that if the coded word is ab, the decoded word can't be cc.

This sample is better:

input

2
ac
ad
xy kz cv

output

ac ad **

----
"a" appears as "x" and "k". Is it ok?

Each letter must be decoded uniquely, that means that if the coded word is ab, the decoded word can't be cc.

And that's what I do! If input gives me "ac" and the dictionary "xy", "xy will appear on output only if a new "ac" appears. That's right, isn't it? a sample follows.

input

2
ac
ad
xy xz ...

What are the gotchas on problem #843? I am almost sure my program works, but I get WA.

Any idea of something I may be missing?