All submissions for this problem are available.
Mo and Larry have devised a way of encrypting messages. They first decide secretly on the
number of columns and write the message (letters only) down the columns, padding
with extra random letters so as to make a rectangular array of letters. For example, if
the message is "There's no place like home on a snowy night" and there are five
columns, Mo would write down
t o i o y
h p k n n
e l e a i
r a h s g
e c o n h
s e m o t
n l e w x
Note that Mo includes only letters and writes them all in lower case. In this example, Mo
used the character 'x' to pad the message out to make a rectangle, although he could
have used any letter. Mo then sends the message to Larry by writing the letters in
each row, alternating left-to-right and right-to-left. So, the above would be encrypted
Your job is to recover for Larry the original message (along with any extra padding letters)
from the encrypted one.
There will be multiple input sets. Input for each set will consist of two lines. The first line will contain an integer in the range 2...20 indicating the number of columns used. The next line is a string of up to 200 lower case letters. The last input set is followed by a line containing a single 0, indicating end of input.
Each input set should generate one line of output, giving the original plaintext message, (with no spaces).
Input: 5 toioynnkpheleaigshareconhtomesnlewx 3 ttyohhieneesiaabss 0 Output: theresnoplacelikehomeonasnowynightx thisistheeasyoneab
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, COB, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.