HDU 1200 To and Fro
来源:互联网 发布:蒙科立蒙古文网络平台 编辑:程序博客网 时间:2024/05/20 05:08
To and Fro
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5525 Accepted Submission(s): 3824
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
注意:
1:找规律即可 水题
#include<stdio.h>#include<string.h>int main (void){ char a[220],c[30][220],i,j; int b,l,k,num; while(~scanf("%d",&b)&&b) { getchar(); gets(a); l=strlen(a); k=l/b; int num=0; for(i=1;i<=k;i++) { if(i%2==1) { c[0][num]=a[(i-1)*b]; num++; } if(i%2==0) { c[0][num]=a[i*b-1]; num++; } } num=0; for(j=1;j<b;j++) { for(i=1,num=0;num<k;num++,i++) { if(num%2==0) { c[j][num]=a[(i-1)*b+j]; } if(num%2==1) { c[j][num]=a[i*b-1-j]; } } } for(i=0;i<b;i++) { for(j=0;j<k;j++) { printf("%c",c[i][j]); } } printf("\n"); } return 0;}
0 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
- CSS 进阶篇
- 对协程的理解
- JdbcTemplate的使用
- 【JCC技术】JCC功能演示
- hdu1698
- HDU 1200 To and Fro
- Java读取文件MD5的两种方案
- C++猴子吃桃问题
- 大数相加
- KRUSKAL算法
- 控制器的基本组成
- Java基础——网络编程(一)
- UILable
- activemq的安装使用