On Wed, Jun 15, 2016 at 12:24 PM, Vladimirr <[email protected]> wrote: > > Similarly, if > G = 101 010 000 > B = 100 > > it is IMPOSSIBLE to create a program, because at every index a digit of at > least one of the "good" strings and the "bad" string matches. > > What's wrong with my reasoning?
Not true. The pair of programs ??1? 001101 can produce any of the G results, but not the B result. -- 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/CAADvV_t9SfCRi7XqKr4eVve7bUtF8KZCf4Zpun90xm-%3DHztpvg%40mail.gmail.com. For more options, visit https://groups.google.com/d/optout.
