That's simply gorgeous, Luke. Did you code it on paper first, or jump straight to the text editor?
On Sun, May 17, 2015 at 11:00 AM Luke Pebody <[email protected]> wrote: > 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 [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/CADat-Gfr1Mz4gv5mxY_0v1TY_ft2%3D4VBcoYXr3D98Cu%3D2uaQeA%40mail.gmail.com > <https://groups.google.com/d/msgid/google-code/CADat-Gfr1Mz4gv5mxY_0v1TY_ft2%3D4VBcoYXr3D98Cu%3D2uaQeA%40mail.gmail.com?utm_medium=email&utm_source=footer> > . > For more options, visit https://groups.google.com/d/optout. > -- 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/CAHaiWHOS1RA-K%2B9XOXvk0-unw7vaYEuuXmFdYWe_x%2B%3DPSj9FLw%40mail.gmail.com. For more options, visit https://groups.google.com/d/optout.
