ZOJ_2208_To and Fro
来源:互联网 发布:淘宝复制找上家 编辑:程序博客网 时间:2024/06/06 14:11
Time Limit: 1 Second Memory Limit: 32768 KB
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
Source: East Central North America 2004
Submit Status #include<iostream>
#include<string>
using namespace std;int main(void)
{
char matrix[20][100];
char str[200];
int col;
int row;
cin>>col;
while( col != 0 ){
cin>>str;
int i, j, k;
row = strlen( str )/col;
for( i = 0; i < row; i+=2 )
for( j = i * col, k = 0; j < ( i * col + col ), k < col; j++, k++ )
matrix[i][k] = str[j];
for( i = 1; i < row; i+=2 )
for( j = ( i * col + col - 1 ), k = 0; j >= i * col, k < col; j--, k++ )
matrix[i][k] = str[j];
for( i = 0; i < col; i++ )
for( j = 0; j < row; j++ )
cout<<matrix[j][i];
cout<<endl;
cin>>col;
}
return 0;
}
- 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
- hdu_1200 To and Fro
- 1547. To and Fro
- HDU1200 To and Fro
- 1007. To and Fro
- 1200 To and Fro
- 采用MapObjects 显示瓦片地图
- oracle10g SQL 跟踪
- google contact API学习笔记一:认证
- 通过画图实现动画效果
- 【DP】 POJ 1080
- ZOJ_2208_To and Fro
- MySQL客户端远程连接1045的错误
- 转帖 java6的@override注解与java5的不同之处 收藏
- 关于c++中局部变量生存期的思考
- 斐波那契数列的另一个递归式
- 深究Java虚拟机
- ZOJ_3313_Clock
- portal介绍
- java 克隆 一个model