1007. To and Fro
来源:互联网 发布:云计算的架构和类型 编辑:程序博客网 时间:2024/05/01 15:16
1007. To and Fro
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
// source code of submission 905881, Zhongshan University Online Judge System#include <iostream>using namespace std;int main(){ int k; cin >> k; while (k != 0) { string s; cin >> s; char a[20][200] = {0}; int n = s.length(); for (int i = 0 ; i < n ; i++) if (i/k%2 == 0) a[i/k][i%k] = s[i]; else a[i/k][k-i%k-1] = s[i]; for (int j = 0 ; j < k; j++) for (int i = 0 ; i < n/k ; i++) cout << a[i][j]; cout << endl; cin >> k; } return 0;}
- 1007. To and Fro
- 1007. To and Fro
- 1007. To and Fro
- 1007. To and Fro
- 1007. To and Fro
- 1007. To and Fro
- 1007. To and Fro
- sicily--1007. To and Fro
- Sicily.1007. To and Fro
- Sicily 1007. To and Fro
- sicily 1007. To and Fro
- sicily 1007.To and Fro
- Sicily 1007. To and Fro
- [sicily]1007. To and Fro
- sicily 1007. To and Fro
- sicily 1007. To and Fro
- Sciliy 1007. To and Fro
- Sicily: 1007. To and Fro
- C# 鼠标拖放图片透明缩略图效果实现思路
- 1014. Specialized Four-Dig
- 如何防止代码腐烂
- 问题Re-installation failed due to different application signatures.解决
- perl: symbol lookup error: /usr/local/lib/libtdsodbc.so: undefined symbol: libiconv_open的解决办法
- 1007. To and Fro
- S3C6410启动模式介绍
- Android2.2.1广播大全
- 验证 text 文本 输入正整数
- Java简单注释讲解
- 长ping 命令,检测网络连接状态
- 1001. Alphacode
- Android开发实例详解之IMF(Android SDK Sample—SoftKeyboard)
- 1000. A-B