poj2039
来源:互联网 发布:mac获取最高权限 编辑:程序博客网 时间:2024/05/22 03:30
To and Fro
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 8052 Accepted: 5367
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<stdio.h>#include<string.h>int main(){char a[200];int n,i,j,l,t,p;while(scanf("%d",&n)!=EOF&&n!=0){ getchar();gets(a);l=strlen(a);t=l/n;for(i=0;i<n;i++){ for(j=1;j<=t;j++) if(j%2==0) printf("%c",a[j*n-i-1]); else printf("%c",a[(j-1)*n+i]);}printf("\n");}return 0;}
- poj2039
- poj2039
- poj2039
- poj2039
- poj2039
- POJ2039:反反复复
- 【poj2039】To and Fro
- POJ2039 To and Fro
- POJ2039--To and Fro--字符串水题
- js table 行上移、下移
- 软件项目管理原则谈
- 语言对比的地方
- STL中map用法详解
- secureCRT The remote system refused the connection.
- poj2039
- iptables预防DDOS和CC攻击配置
- [smart210] UART设置与编程
- jsp servlet 实现登陆验证码
- Android添加自定义广播事件(带多个参数)
- iphone开发中的一些小技巧
- 怎样从一名程序员过度到项目经理
- 角点检测和匹配之Harris与FAST角点检测
- Service与AlarmManager-BroadcastReceiver能否在CPU沉睡下工作