hdu 1200 To and Fro
来源:互联网 发布:华为网络通信设备介绍 编辑:程序博客网 时间:2024/05/20 05:11
To and Fro
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2268 Accepted Submission(s): 1595
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//从输入数据中找出原来的矩形字符结构,再按列优先的顺序输出#include<stdio.h>#include<stdlib.h>#include<string.h>char str[103][23] ;char ch[203] ;int main( ){ int n ; while( scanf("%d", &n ) , n ) { getchar(); gets( ch ) ; int len = strlen( ch ) ; int flag = 1 , j = 0 ,k = 0 ; for( int i = 0 ; i < len ; i++ ) { if( flag ) { str[j][k++] = ch[i] ; if( k == n ) { j++; flag = 0 ; k--; } } else { str[j][k--] = ch[i] ; if( k == -1 ) { j++ ; flag = 1 ; k = 0 ; } } } for( int c = 0 ; c < n ; c++ ) for( int i = 0 ; i < j ; i++ ) printf("%c" , str[i][c] ) ; puts(""); } // system( "pause" ); return 0;}
- hdu 1200 To and Fro
- hdu 1200 To and Fro
- hdu 1200 To and Fro
- HDU 1200 To and Fro
- hdu 1200 To and Fro
- hdu-1200-To and Fro
- HDU-1200To and Fro
- hdu 1200 To and Fro
- hdu 1200 To and Fro
- HDU 1200 To and Fro
- hdu 1200 To and Fro
- HDU 1200 To and Fro
- HDU 1200 To and Fro
- HDU 1200 To and Fro
- hdu 1200 To and Fro
- HDU 1200 To and Fro
- hdu-1200 To and Fro
- HDU 1200 To and Fro
- 用DirectShow实现QQ的音视频聊天功能
- MFC 子线程消息循环的实现
- gcc 笔记 C Dialect Options
- 基于DirectShow的MPEG-4视频传输系统的研究与实现
- HULU2012校招笔试体会
- hdu 1200 To and Fro
- 隐私保护利器-----开辟密盘
- Ubuntu 9.10 构建Linux内核树
- C语言中不同数据类型间混合运算的转换规则
- hdu 1715 大菲波数(Easy)
- 不良代码展示-不要用数组循环判断等于的方式,来判断一个对象是否在一个集合内
- 网页编程中的模态对话框
- hdu 1720 A+B Coming(Easy)
- 第1章 寻找入口