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
--
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/20190412175425.GB2837%40hairstyle.local.
For more options, visit https://groups.google.com/d/optout.
