HDU1200 POJ2039 ZOJ2208 UVALive3084 To and Fro【密码+水题】
2016-07-20 20:59
483 查看
To and Fro
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.
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
Sample Output
Source
East Central North America 2004
Regionals 2004 >> North
America - East Central NA
问题链接:HDU1200 POJ2039 ZOJ2208 UVALive3084 To and Fro。
问题简述:(略)
问题分析:
虽然字符串是放在一维数组里,也可以按二维数组的形式对其进行访问,是一个下标映射的问题。
此外,还需要考虑行的奇偶和行中的顺序访问(奇数行顺序访问)与逆序访问(偶数行逆序访问)。
程序说明:(略)
AC的C语言程序(代码中有C++的注释,需要用C++编译)如下:
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 9285 | Accepted: 6261 |
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
Source
East Central North America 2004
Regionals 2004 >> North
America - East Central NA
问题链接:HDU1200 POJ2039 ZOJ2208 UVALive3084 To and Fro。
问题简述:(略)
问题分析:
虽然字符串是放在一维数组里,也可以按二维数组的形式对其进行访问,是一个下标映射的问题。
此外,还需要考虑行的奇偶和行中的顺序访问(奇数行顺序访问)与逆序访问(偶数行逆序访问)。
程序说明:(略)
AC的C语言程序(代码中有C++的注释,需要用C++编译)如下:
/* HDU1200 POJ2039 ZOJ2208 UVALive3084 To and Fro */ #include <stdio.h> #include <string.h> int main(void) { int c, r, oddeven, len, i, j; char s[200+1]; while(scanf("%d", &c) != EOF) { if(c == 0) break; scanf("%s", s); len = strlen(s); r = len / c; for(j=0; j<c; j++) { // 行循环 oddeven = 0; for(i=0; i<r; i++) { // 列循环 if(oddeven) // 奇数行:逆序 putchar(s[i*c+(c-1-j)]); else // 偶数行:顺序 putchar(s[i*c+j]); oddeven = 1 - oddeven; } } putchar('\n'); } return 0; }
相关文章推荐
- 设计模式--大纲
- Java-File class
- 网络层协议-ICMP协议
- jQuery Mobile 可折叠块
- 【题】【树(树的直径&LCA)】NKOJ 2044 奶牛政坛 【RMQ&LCA】
- matlab中uint8,double,im2uint8,im2double的区别
- 2016暑期集训2——数论(知识点,模板,简单题题解)
- hdu 1062(DFS||dijkstra)
- linux 命令(3)echo
- Java-Map
- CCNA系列五之Trunk
- UVA-10499 The Land of Justice
- 基础命令使用
- HDU4846->区间DP
- iOS数据库操作(基于C语言API)
- 4-16 文件管理 XML解析 JSON GSON 笔记 待整理
- ButterKnife 基本使用
- FakeGame 集成总结
- NYOJ45棋盘覆盖
- 华为上机题整理1——Java实现