Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

Description

Mo and Larry have devised a way of encrypting messages. They first decide secretly on the number ofcolumns and write the message (letters only) down the columns, padding with extra random letters soas to make a rectangular array of letters. For example, if the message is "There's no place like home ona snowy night" and there are five columns, Mo would write downt o i o yh p k n ne l e a ir a h s ge c o n hs e m o tn l e w xNote that Mo includes only letters and writes them all in lower case. In this example, Mo used thecharacter 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 andright-to-left. So, the above would be encrypted astoioynnkpheleaigshareconhtomesnlewxYour job is to recover for Larry the original message (along with any extra padding letters) from theencrypted one.

Input

There will be multiple input sets. Input for each set will consist of two lines. The first line will containan integer in the range 2 . ..20 indicating the number of columns used. The next line is a string of upto 200 lower case letters. The last input set is followed by a line containing a single 0, indicating end ofinput.

Output

Each input set should generate one line of output, giving the original plaintext message, with no spaces.

Sample Input

5
toioynnkpheleaigshareconhtomesnlewx
3
ttyohhieneesiaabss
0


Sample Output

theresnoplacelikehomeonasnowynightx
thisistheeasyoneab


#include<iostream>
#include<cstring>
using namespace std;
char cra[21][101];
char charactor[201];
int main()
{
int n;
while(cin>>n&&n>=2&&n<=20&&n!=0)
{
cin>>charactor;
int len=strlen(charactor);
int row=len/n;
int x=0,y=0;
for(int i=0;i<len;i++)
{
cra[x][y]=charactor[i];
if(x%2==0)
{
y++;
if(y==n)
{
x++;
y--;
}
}
else
{
y--;
if(y==-1)
{
x++;
y++;
}
}
}
for(int j=0;j<n;j++)
{
for(int i=0;i<len/n;i++)
{
cout<<cra[i][j];
}
}
cout<<endl;
}
return 0;

} `

Sicily: 1007. To and Fro

2017-02-25 21:58:16

1007. To and Fro

2014-01-14 18:05:47

[sicily]1007. To and Fro

2015-09-20 22:19:52

sicily 1007. To and Fro

2015-10-11 17:02:08

[sicily online]1007. To and Fro

2012-11-23 16:49:51

Sicily 1007. To and Fro

2014-10-19 22:11:39

1007.Maximum Subsequence Sum (25)

2017-02-04 23:43:52

sicily 1007. To and Fro（破译密码)

2015-12-09 13:53:25

PAT 1007 素数对猜想 (20)

2015-03-10 09:50:24

1007. Red-black Tree (35)

2015-09-23 17:47:24

不良信息举报

Sciliy 1007. To and Fro