hdoj 1200 To and Fro【字符串变形】
2015-08-02 17:18
531 查看
To and Fro
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5516 Accepted Submission(s): 3816
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.
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
#include<stdio.h> #include<string.h> char c[201],s[101][101]; int main() { int i,j,k,l,m,n,h; while(scanf("%d",&n),n) { getchar(); gets(c); l=strlen(c); j=1; for( i =0 ; c[i]!='\0' ; ) { if( j%2!=0 ) for(k=1;k<=n;k++)//奇数行 当前顺序存 { s[j][k]=c[i++]; } else for(k=n ;k>=1 ;k--)// 偶数行 当前逆序存 { s[j][k]=c[i++]; } j++; } for( k=1; k<=n; k++ ) for( j=1; j<=l/n; j++ ) { printf("%c",s[j][k]); } printf("\n"); } return 0; }
相关文章推荐
- Eclipse(MyEclipse) 设置默认编码为Utf-8 之最全方法
- 关于activity中保存数据
- 交叉验证的缺陷及改进(Cross Validation done wrong)
- HDOJ1073(gets 应用)
- 博客推荐
- UVa 11258 - String Partition(dp)
- 【zoj3524】【Crazy Shopping】
- 图论浅析--最短路之Bellman-Ford
- hihoCoder 1069 最近公共祖先·三
- 图论浅析--最短路之Bellman-Ford
- laravel中的$request对象构造及请求生命周期
- Where is the Marble?
- Leetcode #223 Rectangle Area
- diffork.c
- 一个简单的模板引(han)擎(shu)
- 阿里2013双十一备战中的技术突破
- window删除损坏无法打开的文件
- 多校4-Walk Out
- AVL 树的插入和删除
- 奈氏准则和香农公式