TOANDFRO - To and Fro

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 as


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.






hide comments
nani: 2012-07-13 17:10:51

Last edit: 2014-02-08 03:28:03
Nelson Taveras: 2012-07-11 12:52:24

Nice problem.

StupidGuy: 2012-07-05 07:31:33

This was FUN :)

divya jain: 2012-06-05 17:09:45

interesting :)

suvrat: 2012-04-25 14:40:32

Can I send my solution to some1. I am getting correct ans for my test cases.

#vaidy_MIT#: 2012-04-21 06:38:47

AWEsome problem ...:)had fun ..:)

Last edit: 2012-04-21 06:39:40
Albert Chen: 2012-01-17 20:56:08

There is no tricky test case, I think.

:-): 2011-12-01 12:13:26

can any one provide me with test cases my code is giving correct ans for the above test cases but still getting a WA. :(

Adrian Kuegel: 2011-08-18 11:18:14

This is the original problem statement. It seems they decided not to give that information. Anyway, you can write a solution independent of knowing the number of test cases.

Giovanni Botta: 2011-08-17 14:19:12

It would be useful to know the maximum number of test cases...

Added by:Adrian Kuegel
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Resource: ACM East Central North America Regional Programming Contest 2004