POJ-2039 To and Fro
2016-01-07 20:03
387 查看
To and Fro
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 8694 Accepted: 5847
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
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 8694 Accepted: 5847
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 <iostream> #include <string.h> #include <algorithm> #include <math.h> #include <stdlib.h> using namespace std; char a[205]; char b[25][25]; int n; int main() { while(scanf("%d",&n)!=EOF) { if(n==0) break; scanf("%s",a); int len=strlen(a); for(int i=0;i<len;i++) { if((i/n)%2==0) b[i/n][i%n]=a[i]; if((i/n)%2==1) { b[i/n][n-i%n-1]=a[i]; } } int len2=len/n; for(int i=0;i<n;i++) for(int j=0;j<len2;j++) printf("%c",b[j][i]); printf("\n"); } return 0; }
相关文章推荐
- 关于机器视觉未来发展的定位
- 卷积的意义
- 三道tricky的Leetcode面试题目解析
- POJ-2039 To and Fro
- net.paoding.analysis.exception.PaodingAnalysisException: dic home should not be a file, but a directory!
- linux安装openssl
- Apache Email 遇到的线程释放慢问题
- pip:指定多个源/内部源
- 联机查询和批量加工的思考
- ajax jsonp parsererror原因及解决方法(不是格式问题!)
- 取近似值
- HTTP协议中session与cookie的联系与区别
- Zepto
- [NOI2004]郁闷的出纳员 (Splay)
- 判断字符是否是汉字,ByteType字符串中判断是否英文
- centos下的防火墙配置
- POJ-2029 Get Many Persimmon Trees(动态规划)
- Javascript数组方法
- POJ-2029 Get Many Persimmon Trees(动态规划)
- 代码改错有感