hdu oj 1200 To and Fro
来源:互联网 发布:国外电视直播软件 编辑:程序博客网 时间:2024/05/17 07:12
source: http://acm.hdu.edu.cn/showproblem.php?pid=1200
To and Fro
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6395 Accepted Submission(s): 4393
Problem 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.
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
#include <iostream>#include <string>#include <cstring>//#include <fstream>using namespace std;int main(){ int n; string s;/* int a = 2 ; int b = 3 ; if(a&1) cout << "a " << a << endl; if(b&1) cout << "b " << b << endl;*/ //ifstream icin("a.txt"); while(cin >> n && n){ cin >> s; int len = s.length(); for(int i = 0; i < n;i++) { for(int j = 0; j < len / n;j++){ if(j & 1){ cout << s[j*n + n -i - 1]; } // odd else { //even cout << s[j*n + i]; } } } cout << endl; } return 0;}//题目分析:// 加密解密,将字符串s按照一定规律编码,输出原文//有趣的point:// 判断奇数、偶数 if (i & 1) > i is odd. else > i is even.
even || odd
bit运算: 4 & 1 => 0100 & 0001 => i = 0
参考资料:
【1】What does int i = i&1 mean in C programming language? http://stackoverflow.com/questions/33787546/what-does-int-i-i1-mean-in-c-programming-language
0 0
- hdu-oj 1200 To and Fro
- hdu oj 1200 To and Fro
- hdu 1200 To and Fro
- hdu 1200 To and Fro
- hdu 1200 To and Fro
- HDU 1200 To and Fro
- hdu 1200 To and Fro
- hdu-1200-To and Fro
- HDU-1200To and Fro
- hdu 1200 To and Fro
- hdu 1200 To and Fro
- HDU 1200 To and Fro
- hdu 1200 To and Fro
- HDU 1200 To and Fro
- HDU 1200 To and Fro
- HDU 1200 To and Fro
- hdu 1200 To and Fro
- HDU 1200 To and Fro
- 解决Android界面布局添加EditText组件后界面无法预览的问题
- SDP协议分析
- 埃拉托色尼筛选法--JAVA
- dark story
- div li的多行多列 无刷新分页
- hdu oj 1200 To and Fro
- ThreadPoolExecutor原理及使用
- Python.科学计算 -- 综合运用,替代Matlab
- HDU 1165 Eddy's research II (数学推导)
- 【微信开发】-发送位置进行Route Matrix API v2.0批量算路接口, 主要代码在private function receiveLocation($object)
- linux(ubuntu)下成功编译安装了下切片软件CuraEngine
- 以太网帧结构
- 算法与数据结构题目 4.3 不知道取什么好
- 创建自己的MVC框架,深入理解mvc