hdu-oj 1200 To and Fro
来源:互联网 发布:c语言的index函数用法 编辑:程序博客网 时间:2024/05/20 23:04
To and Fro
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4683 Accepted Submission(s): 3267
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 <string.h>char s[210];int main(){ int n,m,i,j,t; char ch; while(scanf("%d",&n),n){ getchar(); scanf("%s",s); m=strlen(s); for(i=n;i<m;i+=2*n){ t=1; for(j=i;j<i+n/2;j++){ ch=s[j]; s[j]=s[i+n-t]; s[i+n-t]=ch; t++; } } int x,y; x=n;y=n; while(x--){ for(i=0;i<m;i++) if((i+y)%n==0) printf("%c",s[i]); y--; } printf("\n"); } return 0;}
0 0
- hdu-oj 1200 To and Fro
- hdu oj 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-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
- HDOJ 3507 Print Article
- 用例图的泛化、扩展和包含
- 用Comparator对List<Map>进行排序
- Android杂谈--ListView之BaseAdapter的使用
- NOJ1110奇数排序——超时,看写法,需要较灵活的思维!
- hdu-oj 1200 To and Fro
- uva 10808 - Rational Resistors(基尔霍夫定律+高斯消元)
- hibernate proxool 配置
- 数据存储之SharedPreferences
- poj1459 Power Network
- Queue1 -using two stacks impliment
- IOS百度地图开发
- TCP为什么要三次握手,不是两次四次?
- POJ 3233 矩阵链乘