Hey guys, I have commented one of the solutions to Problem A of Round 1A (Charging Chaos). If you were stuck on that problem, check it out!
Solution <http://goo.gl/x3mHF6> (C++) The main thing to note in the problem was that only 'N' combinations of flips are possible, since the bitsets of the devices are constant. -- Regards, Vaibhav Tulsyan. -- 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/CAHzezBx7SebRH%3DipreSkdQvXEe5pTvJQq2zaPsGAfLfFvjf-0A%40mail.gmail.com. For more options, visit https://groups.google.com/d/optout.
