POJ 2039:To and Fro
2015-08-11 10:23
579 查看
To and Fro
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
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
Sample Output
洪水,加密解密。用二维数组存储,以行为单位输入,再从列为单位输出。
代码:
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 8632 | Accepted: 5797 |
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 <iostream> #include <algorithm> #include <cmath> #include <vector> #include <string> #include <cstring> #pragma warning(disable:4996) using namespace std; int column; char value[201][201]; string test; int main() { int i,j,num; int len,row; while(cin>>column) { if(column==0) break; cin>>test; len=test.length(); row=len/column; num=0; for(i=1;i<=row;i++) { if(i%2) { for(j=1;j<=column;j++) { value[i][j]=test[num]; num++; } } else { for(j=column;j>=1;j--) { value[i][j]=test[num]; num++; } } } for(j=1;j<=column;j++) { for(i=1;i<=row;i++) { cout<<value[i][j]; } } cout<<endl; } return 0; }
相关文章推荐
- for变量作用域(vc6与vs)
- spring管理事物(增删改的事物回滚等)
- 在VS2013中 用opencv循环读取文件夹下的文件
- 【小熊刷题】valid number - 各种edge cases真是醉了
- Binary Tree Postorder Traversal
- html中图片走马灯效果
- USACO 2012 December Contest, Bronze Problem 1. Meet and Greet (模拟)
- hdu4763
- windows下目录无法删除的问题,QQ浏览器的BUG
- 搭建Java Web项目 Maven管理jar包
- JDK环境变量配置方法详解
- 【.Net码农】关于使用FileUpload控件报 Could not find a part of the path "X/1.jpg"
- hiho #1055 : 刷油漆
- EFSQLserver
- HDU 1498 50 years, 50 colors
- Java 多线程之happens-before规则解释
- PHP面向对象(OOP):抽象方法和抽象类(abstract)
- 我的微信订阅号开发--新手篇
- HDU 1321 Reverse Text
- Java实现图的深度和广度优先遍历算法