POJ 2039:To and Fro
来源:互联网 发布:ami js 编辑:程序博客网 时间:2024/05/18 15:25
To and Fro
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 8632 Accepted: 5797
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.
t o i o yh p k n ne l e a ir a h s ge c o n hs e m o tn 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 <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;}
0 0
- poj 2039 To and Fro
- poj 2039 To and Fro
- poj 2039 To and Fro
- POJ 2039:To and Fro
- POJ-2039 To and Fro
- POJ 2039 To and Fro
- POJ 2039 TO and Fro(模拟)
- POJ 2039 To and Fro(水题)
- POJ 2039 To and Fro G++
- To and Fro-2039
- POJ 2039 To and Fro
- poj 2039 To and Fro【字符数组操作】
- POJ 2039 && HDU 1200 To and Fro(水~)
- sicily1007. To and Fro
- 1007. To and Fro
- 1007. To and Fro
- zoj2208--------------------To and Fro
- 1007. To and Fro
- hdu4763
- 我的微信订阅号开发--新手篇
- 在VS2013中 用opencv循环读取文件夹下的文件
- 【.Net码农】关于使用FileUpload控件报 Could not find a part of the path "X/1.jpg"
- JDK环境变量配置方法详解
- POJ 2039:To and Fro
- 根据日期,转换成星座、生肖工具类
- 搭建Java Web项目 Maven管理jar包
- UIWebView加载本地HTML5文件
- HDU2193-AVL-数据结构-AVL
- 【小熊刷题】valid number - 各种edge cases真是醉了
- 语义分析的一些方法(一)
- Java中的lock类型
- 19-集合框架工具类-18-常用对象API(集合框架-工具类-Arrays-asList方法)