ZOJ 2208 To and Fro
来源:互联网 发布:淘宝客网站推广技巧 编辑:程序博客网 时间:2024/06/04 00:49
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.
SampleInput
5
toioynnkpheleaigshareconhtomesnlewx
3
ttyohhieneesiaabss
0
SampleOutput
theresnoplacelikehomeonasnowynightx
thisistheeasyoneab
简单题,按题意模拟即可
#include<bits/stdc++.h>using namespace std;const int N=1e5+10;int n;char f[50][50];char s[N];int main(){ while(~scanf("%d",&n)&&n) { scanf("%s",s); int sz = 0; for (int i=0,j=0,k=1;s[i];i++) { f[sz][j]=s[i]; if (j+k==n||j+k==-1) { k=-k; sz++; } else j+=k; } for (int i=0;i<n;i++) { for (int j=0;j<sz;j++) { putchar(f[j][i]); } } putchar(10); } return 0;}
- zoj 2208 To and Fro
- zoj 2208 To and Fro
- ZOJ 2208 To and Fro
- zoj 2208 To and Fro
- ZOJ 2208 To and Fro
- HDU 1200 || ZOJ 2208 To and Fro
- sicily1007. To and Fro
- 1007. To and Fro
- 1007. To and Fro
- zoj2208--------------------To and Fro
- 1007. To and Fro
- To and Fro
- To and Fro
- HDU1200:To and Fro
- 1007[To and Fro]
- To and Fro
- 1007. To and Fro
- sicily1007. To and Fro
- 《统计学习方法》——对偶感知器的python实现
- uva1600 -- Patrol Robot
- ZOJ 2388 Beat the Spread!
- 48. Rotate Image
- Android开发中的小技巧(1)
- ZOJ 2208 To and Fro
- 基于空间相关的图像模板匹配及MATLAB实现
- jdk环境的配置
- 【C语言】常用的转义字符及其含义
- android学习笔记(4)
- 一条sql语句分组、升序、指定条数查询
- Exploring Heap-Based Buffer Overflows with the Application Verifier
- ZOJ 2256Mincost
- 【单例模式】简单C++实现