Reading the Contest Analysis[0] from GCJ Qualification 2016, for the Problem B is said that
> In the small case we have a stack of at most 10 pancakes. The total number of > possible different states we can get by performing any number of flips is > thus 210= 1024. As this is a small number of states, we can solve the small > test case by performing a breadth first search over this state space. For N > pancakes, this can be implemented to complete within O(N 2**N) time. I don't understand if it's just an hint or a complete solution. What does they mean exactly by "breadth first search"ing over all the possible 1024 state? Thanks, Giuseppe --- [0], https://code.google.com/codejam/contest/6254486/dashboard#s=a&a=1 -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/CABuo9_aD0rX_SYjehu1VYwXS3M1KLUiD8ZzZAgArg-F2pYHTnw%40mail.gmail.com. For more options, visit https://groups.google.com/d/optout.
