Hey smloh, thanks for the excellent code. After a night of pondering I arrived at the same solution albeit counting from the back of the string. I did it in PHP and do some cleaning before counting (superfluous chars, chars that occur before/after their place in the pattern, replacing double chars in the pattern making all unique). I can post the code, if someone wants... I had some minor errors that I was able to expunge using your code and solutions to my input. Now we both arrive at the same solution for all inputs. Sadly, the practice-mode judge says that they are both wrong for the large input set. Any idea whats going on?
On Sep 4, 1:14 am, smloh <[email protected]> wrote: > I'm going to try to provide an intuitive explanation of the logic I > used for Problem C, in the hope it may help some fellow programmers. > > First the code, in old-fashioned C: > #include <stdio.h> > #include <stdlib.h> > #include <string.h> > int main(int argc,char *argv[]) > { [...] --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/google-code?hl=en -~----------~----~----~----~------~----~------~--~---
