OJ Board

My system is about twice as fast as the UvA judge.

In my program where I pick the next digit I tried to both iterate both forward and backward. When I iterate forward it takes me 1654 seconds to compute the answers for all valid inputs.

When I iterate backward I can do everything except (B=27,N ...

I think this should be fixed with some urgence. I spent valuable time looking for bugs that weren't there.

Johan de Ruiter

Hi,

I was wondering if someone might have some good testcases for my code. I was confused by:

- the extra words that seem to be in the input (I chose to regard them as wrong rather than ignore them)
- the apostroph in the output (I just copied it from the example output, even though it seems to ...

Well it worked with only minor changes for a quite similar problem here in the archive, so I'll count the point. Thanks.

Do you get time-out?

-edit: I have the same number of solutions -

Hi,

My 536 passes the example testcase, but a submission results in a wrong answer. Does anybody have a hint or perhaps some nice testcases?

The idea behind the code below is this:

1) The root is first element of the pre-order traversal
2) Everything left of the root in the in-order traversal ...

Hi,

I just wrote my first program for a problem in the Live Archive (problem 3300 - Snake Pit), but after submitting it said "can't be judged". I found somewhere it means there are no testdata available for this problem. Will they come? And if so, will I need to submit my code again?

Kind regards ...