HDU1200 To and Fro
来源:互联网 发布:淘宝店铺宝贝数量 编辑:程序博客网 时间:2024/06/11 19:10
To and Fro
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4697 Accepted Submission(s): 3278
Problem 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.
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
5toioynnkpheleaigshareconhtomesnlewx3ttyohhieneesiaabss0
Sample Output
theresnoplacelikehomeonasnowynightxthisistheeasyoneab
Source
East Central North America 2004
#include <stdio.h>#include <string.h>char map[200][30];char str[210];int main(){ int n, i, j, k; while(scanf("%d", &n), n){ scanf("%s", str); i = j = 1; k = 0; while(1){ while(j <= n) map[i][j++] = str[k++]; if(!str[k]) break; ++i; j = n; while(j > 0) map[i][j--] = str[k++]; if(!str[k]) break; ++i; j = 1; } for(j = 1; j <= n; ++j) for(k = 1; k <= i; ++k) putchar(map[k][j]); printf("\n"); } return 0;}
0 0
- HDU1200:To and Fro
- HDU1200 To and Fro
- HDU1200 To and Fro
- HDU1200——To and Fro
- HDU1200-To and Fro(字符串)
- sicily1007. To and Fro
- 1007. To and Fro
- 1007. To and Fro
- zoj2208--------------------To and Fro
- 1007. To and Fro
- To and Fro
- To and Fro
- 1007[To and Fro]
- To and Fro
- 1007. To and Fro
- sicily1007. To and Fro
- hdu_1200 To and Fro
- 1547. To and Fro
- Google开源实时通信项目WebRTC
- 用url读取沙河路径,或要写入的方法
- 欧拉定理、费马小定理、逆元理论基础
- eclipse集成svn后出现Failed to load JavaHL Library的解决办法
- 录音的
- HDU1200 To and Fro
- iOS_25_彩票骨架搭建+导航栏适配
- Linux程序设计笔记(第4章 Linux环境)
- 设置可编辑
- javascript学习笔记
- OCP试题解析之053-17 CONFIGURE CONTROLFILE AUTOBACKUP ON
- 第十章 10.5.3节练习 & 10.6节练习
- 【LeetCode】Linked List Cycle II
- 音效和音乐播放要用到的方法