El viernes, 12 de abril de 2019, 21:06:40 (UTC+2), Matteo Landi escribió: > On 04/10, Marcel Ubach wrote: > >Try this one: > > > >1 > >101 30 > >6 6 6 9 9 6 10 35 77 143 221 323 437 667 899 1147 1517 1763 2021 2491 3127 > >3599 4087 4757 5183 5767 6557 7387 8633 9797 10403 > > > >Expected output: > >Case #1: ABABBBACDEFGHIJKLMNOPQRSTUVWXYZ > > > >Your output: > >Case #1: BABACABBEDGEIFMGPHRJSKTLUNVOWQX > > Is this a valid input, though? L is 30 in this case but then the > cyphertext length is 31. > > Are we supposed to trust L, and ignore any extra number from the > cyphertext? If so that would be quite disappointing.. > > Matteo > > -- > Matteo Landi > https://matteolandi.net
My mistake, sorry! Actually the test was intended to be length 30 but I added a wrong last number when publishing, i.e. it should be: 1 101 30 6 6 6 9 9 6 10 35 77 143 221 323 437 667 899 1147 1517 1763 2021 2491 3127 3599 4087 4757 5183 5767 6557 7387 8633 9797 and the correct answer: Case #1: ABABBBACDEFGHIJKLMNOPQRSTUVWXYZ The idea is to have a triple repetition and it's important that it's B rather than A because it's a case not mentioned in the analysis and so it's easy to miss. In practice I assume we can trust L will be correct. Luckily Google engineers are more careful than I am :-) -- 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/71f27cdc-d162-4e6c-bc87-77d1b3530b67%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
