For the question Round 1C 2015 B, (typewriter monkey), I think there must have been an elegant non-brute force method. But with the pressure of time I just decided to just go brute force and it was only good to solve the small data-set. (meaning trying out every typing combinations and counting probabilities).
How did you guys manage to solve the large data-set? Thanks. -- 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/2d98a18c-d205-4ca1-b41d-5d40bf9cf390%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
