Yes, they are available on the web site. My solution for problem A was just to convert the words to regexs:
(ab)c(cd) --> [ab]c[cd] and then tested the regex against all the vocabulary of the language. -- Pedro On Thu, Sep 3, 2009 at 10:44 PM, Dhruva Sagar <dhruva.sa...@gmail.com>wrote: > I finished only problem A for both small & large :(. > Came close to finishing B, but time ran out. > > Is it possible to see others' solutions ? I would love to. > > Thanks & Regards, > Dhruva Sagar. > > > Pablo Picasso<http://www.brainyquote.com/quotes/authors/p/pablo_picasso.html> > - "Computers are useless. They can only give you answers." > > On Fri, Sep 4, 2009 at 6:55 AM, MagicLi <musicl...@gmail.com> wrote: > >> >> I finish problem A&B, for problem C, I finish the small input, my >> program fail the large input. I think there is better algorithm to >> work it out. >> >> >> > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to google-code@googlegroups.com To unsubscribe from this group, send email to google-code+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/google-code?hl=en -~----------~----~----~----~------~----~------~--~---
