zoukankan      html  css  js  c++  java
  • zoj 2208 To and Fro

    ZOJ Problem Set - 2208
    To and Fro

    Time Limit: 1 Second      Memory Limit: 32768 KB

    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.

    SampleInput

    5
    toioynnkpheleaigshareconhtomesnlewx
    3
    ttyohhieneesiaabss
    0

    SampleOutput

    theresnoplacelikehomeonasnowynightx
    thisistheeasyoneab


    Source: East Central North America 2004
    Submit    Status
    Problem Id:1056  User Id:wupanlei 
    Memory:912K  Time:75MS
    Language:G
    ++  Result:Accepted

    Source 

    #include 
    <iostream>
    #include 
    <string>
    #define MAX 202
    using namespace std;
    int n;
    char ch[MAX][MAX];
    int main()
    {
        
    int i,len,j,k;
        
    string str;
        
    while(cin>>n&&n!=0)
        {
            cin
    >>str;
            len
    =str.length();
            i
    =0;
            j
    =0;
            
    bool mark=false;
            
    for(k=0;k<len;k++)
            {
                
    if(!mark)
                {
                    ch[i][j]
    =str[k];
                    j
    ++;
                }
                
    if(mark)
                {
                    ch[i][j]
    =str[k];
                    j
    --;
                }
                
    if(j==n)
                {
                    i
    ++;
                    j
    =n-1;
                    mark
    =true;
                }
                
    if(j==-1)
                {
                    i
    ++;
                    j
    =0;
                    mark
    =false;
                }
            }
            
    int tt=i;
            
    for(i=0;i<n;i++)
                
    for(j=0;j<tt;j++)
                {
                    cout
    <<ch[j][i];
                }
            cout
    <<endl;
        }
        
    return 0;
    }

  • 相关阅读:
    不用if/else swich for while实现累加
    1.java数据结构
    青蛙跳台阶问题
    next与nextLine
    9.遗传算法
    Docker镜像管理
    Docker镜像管理
    CentOS 6.7安装Docker
    CentOS 6.7安装Docker
    数字三角形_递归_递推(动态规划)
  • 原文地址:https://www.cnblogs.com/forever4444/p/1453729.html
Copyright © 2011-2022 走看看