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
shreyans012: 2019-08-25 14:28:34

@mriow you mean both of them will give O(N*N) I guess.

mriow: 2019-08-09 08:17:11

Two options:
1. Use a matrix data structure.
2. Just use stack and queues.
Both of them give O(n) time.

ycdxc: 2019-08-08 12:41:23

Very easy. AC in one go. NO matrix needed.

moh_game_dev: 2019-07-28 20:23:13

my solution is working but giving WA

shadowfox38: 2019-07-23 14:19:43

Read the problem carefully..its left to right and right to left

Last edit: 2019-07-23 14:27:54
shareefiiit: 2019-07-23 12:19:49

think easy one

rikilg: 2019-07-19 13:51:17

AC in one go!

sanket17: 2019-07-08 10:26:15

Last edit: 2019-07-08 11:22:27
selfcoder24: 2019-05-21 12:12:21

Small "!=" comparison costed my WA 2 times. Nice problem. I suggest people to just do it with strings in liner time.

mgroovyank: 2019-04-18 07:11:24

AC in one go! Try to solve without matrix. It's easy!

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