OJ Board

Just to give my 2 cent as comment: I can prove that there is such input, because I have a program which won't be accepted if I change the abort condition of the loop to NOT check the number of remaining cards. Instead my program gets a segmentation fault or "Floating Point Error" with this modificat...

Ok, so I AM to stupid

I obviously miss some important aspect of the problem, because
I am VERY sure that my solution won't work with 100000 sticks,
even tuned as hell... (So I have to think a lot harder about this... sigh
somehow I don't get it...)

so long
lundril

After getting a "memory exceeded" I ask myself: Is this Problem NP Complete, and is my heuristic simply not good enough or am I to stupid to see the trick. At the moment I basically use dynamic programming. (I try to iterativly build up the original sticks from the stick fragments, and store the sol...

Hi, after changing the program so it doesn't get TLEs (yes i should have thought first :smile:) I get Wrong Answer. Problem: I checked now with various inputs, and I don't get a Wrong Answer in my own tests. So I'm asking myself (again) if there is something special about the input: What is "EOL" is...

After three wrong answers here some questions: Besides checking all these not very well defined border cases (for example is it possible to have a cat of height 1 in the BEGINNING, that means only one worker cat and none else (I can't see that it is stated that the initial cat can't be a worker cat)...

Hi,

I just solved problem 110 with a presentation
error. Now I am curious why I get one...

Is this problem multiple input or not
(it says so in the problem list, but not
in the text of the problem itself...)

so long
lundril