Thinking about regular expressions this weekend (and how they are equivalent to discrete finite-state automatons), I realised that Problem C from this year's Qualification Round could be solved quite cleanly by a regular expression. I compiled a 653,804 character regex that would work, but in order for it to compile in python, I needed to change the groups to be non-capturing, which increased it to 880,876 characters. I'm sure there is a shorter version of the regex possible.
I have left the beautiful regex solution at https://gist.github.com/anonymous/b9e1f03249c7c2834484 -- 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 google-code+unsubscr...@googlegroups.com. To post to this group, send email to google-code@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/CAECKw-Ozm-EG94F88TV1EPFgFzN5F%3DhxHEHRNyfL%2BFqqc4_dZQ%40mail.gmail.com. For more options, visit https://groups.google.com/d/optout.
