I did a lot of investigation during the round. The problem for me was that I didn't know when to stop - when irregularities I noticed would be enough to get correct answer. Remembering last year's "Good Luck" (another Mitrichev style problem ;) I though that to get through you really need to be mathematically precise in calculating probabilities. It turned out that this new problem allowed for more sloppy solutions.
So the irregularity I found was enough to solve it. Irregularity was like this: in 1 place numbers 2 - 500 are more likely to appear in 2 place numbers 3 - 501 are more likely to appear ...... in 501 place numbers 502-1000 are more likely to appear in 999 place number 1000 is more likely to appear. I actually spent quite a lot of time trying to figure out HOW much likely. That proved to be unnecessary. Then you can calculate measure X of how many numbers follow pattern above. After that, you can use behavioral weapon against problem designers (sorry Petr, this trick did work but I am still interested if you tried to counter this hack?) and assume that half of testcases is BAD and half is GOOD and assign BAD to top half and GOOD to bottom half. -- 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/97bd84d2-8753-46e3-9a37-dc204581db6b%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
