OJ Board

Nevermind =). I was missing two edge cases. In particular (for anyone else looking for ideas) I made a mistake when paskill was in 'Z' and when lisper was in 'A'. And all of those statements above are necessary.

I'm getting WA for this problem and I've written and re-written my solution and can't seem to get it.

I pass all of the tests found here: http://acm.uva.es/board/viewtopic.php?t=196

So I'm not really sure where the problem is. Anyone else have extra test sets? Any common common mistakes?

Are ...

To much surprise, this problem is actually somewhat prominent in Academia. In fact, the minimum number of flips for all n! orderings of n pancakes is unknown for n >= 14. It cannot exhaustively be searched because 14! (factorial) is 87,178,291,200. There are many papers in academia bounding the ...

Clearly if v is 1 then you have division by zero. Try a few test cases where N=1 (you should be able to produce the a and b values after picking a k value).

I thought I could find a counter-example to your greedy choice, but I can't seem to find it at this moment.

Practicing for the world finals I wrote a greedy solution, and I ended up proving to myself that it cannot possibly be greedy (any choice of picking has a counter example). Maybe I didn't ...