TOJ1547. To and Fro

1547.   To and Fro

---

Time Limit: 1.0 Seconds   Memory Limit: 65536K
Total Runs: 878   Accepted Runs: 688

---

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

toioynnkpheleaigshareconhtomesnlewx

Your job is to recover for Larry the original message (along with any extra padding letters) from the encrypted one.

Input

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.

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<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
char str[210];
queue<char>q;
int main()
{
    int n,i,len,lie1,lie2,ok,k;
    while(cin>>n&&n)
    {
     getchar();
      cin>>str;
      len=strlen(str);
      for(i=0;i<len;i++)
        q.push(str[i]);
        ok=1;
        lie1=len/n;
        //cout<<len<<lie1<<endl;
      
    while(!q.empty())
    {   
      while(1)                               //依 次 输 出   N 列 
      {     ok=1;
            lie2=lie1;
            while(lie2--)                  //第一次 完成 输出 第一列 
            { 
               k=n-1;
              if(ok==1)               //先输出后进栈 
              {
                cout<<q.front();
                q.pop();
                ok=0;
                while(k--)
                {
                  q.push(q.front());
                  q.pop();
                }
                continue;
              }
              if(ok==0)               //先进栈后输出 
              {   k=n-1;
                  while(k--)
                    {
                      q.push(q.front());
                      q.pop();
                    }
                cout<<q.front();
                q.pop();
                ok=1;
                continue;
              }
           } 
       n--;
       //printf("n==%d**",n);//
           if(n==0)break;
      }
    }
    cout<<endl;         
    }
    return 0;
}