1007. To and Fro
Constraints
Time Limit: 1 secs, Memory Limit: 32 MB
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> using namespace std; int main() { int t; int num; string s; string str[1000]; string a; while (true) { cin >> num; if (num != 0) { cin >> s; a.clear(); int length = s.size(); int temp = length / num; if (temp % 2 == 0) { int sum = length / (2 * num); for (int i = 0; i < sum; ++ i) { str[i].assign(s, 2 * num * (i), 2 * num); } for (int k = 0, j = 2 * num - 1; k < j; ++ k, -- j) { for (int i = 0; i < sum; ++ i) { a.append(1, str[i][k]); a.append(1, str[i][j]); } } } else { int sum = length / (2 * num); for (int i = 0; i < sum; ++ i) { str[i].assign(s, 2 * num * (i), 2 * num); } for (int k = 0, j = 2 * num - 1; k < j; ++ k, -- j) { for (int i = 0; i < sum; ++ i) { a.append(1, str[i][k]); a.append(1, str[i][j]); } a.append(1,s[length - num + k]); } } cout << a << endl; } else { break; } } }
相关推荐
sicily 1562_LVM.cpp参考代码
中山大学 ACM sicily 1294 题目代码
sicily1007题答案,附代码解释,可以在平台上通过
sicily 1274的AC源码,通过且速度快,适合学生使用
本程序解决了Sicily平台上Queue的问题,有较好的可读性
本程序是中山大学sicily-1137-1145-1146-1147-1154-1157-1194的代码
这是C++解题常用的模板,对参加C++机试有较大帮助
西西里全部练习输入输出以及标准程序 超高精度浮点数的输出问题 关联数组
本程序是中山大学sicily 1004-1007-1010-1014-1021 参考代码
But because there are so many roads I can walk through, and maybe I can’t go to Merlin’s house following these roads, I must judge whether I can post the letter to Merlin before starting my travel....
sicily 1817和1818的程序,各有两种方法,供参考。
本程序是中山大学sicily上1200-1221-1298-1324-1325的参考代码。
包括 sicily online judge 1149等部分题目,线性表,最小生成树,中缀转后缀并计算后缀表达式等。
sicily部分源代码,全都亲测,可通过
中大sicily online judge的刷题指南,里面介绍得很详细,不过,最近sicily好像不能外网访问了。
1005. 有向图边的分类 12图算法例题1000. sicily 1155. Can I Post the letteTime Limit: 1sec Mem
112页的大礼包,sicily的部分ac代码。
sicily(soj) 1022 1064 1310 1740 1876 1934 六题的源代码(数据结构综合应用题)
本cpp是sicily的1006的解题代码 这份代码以最简单的方式实现了它的功能要求 值得学习一番
Sicily的题目分类:各种题目的分类,大致方法,以及题目难度规范