sicily 1007.To and Fro 考察输入的更改

Sicily

1007. To and Fro

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 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>
using namespace std;
char a[400][400];
int n;
int main()
{
    string s;
    while(cin>>n && n!=0){
        cin>>s;
        int cnt=0;
        for(int i=0;i<s.size();i+=n){
            if(cnt&1) {                           
                for(int j=0;j<n;j++)
                     a[cnt][j]=s[i+n-1-j];//cout<<"a[ou][j]="<<a[cnt][j]<<endl;
            }
            else{
                for(int j=0;j<n;j++)
                    a[cnt][j]=s[i+j];//cout<<"a[odd][j]="<<a[cnt][j]<<endl;  
            }                                                                                                                                                
            cnt++;                                                                                                    
        }
        for(int i=0;i<n;i++)
            for(int j=0;j<(s.size())/n;j++)
                cout<<a[j][i];
        cout<<endl;
    }    
    return 0;
} 
复制代码

 



posted @   y丫t  阅读(383)  评论(0编辑  收藏  举报
编辑推荐:
· 深入理解 Mybatis 分库分表执行原理
· 如何打造一个高并发系统?
· .NET Core GC压缩(compact_phase)底层原理浅谈
· 现代计算机视觉入门之:什么是图片特征编码
· .NET 9 new features-C#13新的锁类型和语义
阅读排行:
· Sdcb Chats 技术博客:数据库 ID 选型的曲折之路 - 从 Guid 到自增 ID,再到
· 语音处理 开源项目 EchoSharp
· 《HelloGitHub》第 106 期
· Spring AI + Ollama 实现 deepseek-r1 的API服务和调用
· 使用 Dify + LLM 构建精确任务处理应用
点击右上角即可分享
微信分享提示