SRM144_Binary Code_550分题目
来源:互联网 发布:水晶报表 java 编辑:程序博客网 时间:2024/06/04 00:46
Problem Statement
Let's say you have a binary string such as the following:
011100011
One way to encrypt this string is to add to each digit the sum of its adjacent digits. For example, the above string would become:
123210122
In particular, if P is the original string, and Q is the encrypted string, then Q[i] = P[i-1] + P[i] + P[i+1] for all digit positions i. Characters off the left and right edges of the string are treated as zeroes.
An encrypted string given to you in this format can be decoded as follows (using 123210122 as an example):
- Assume P[0] = 0.
- Because Q[0] = P[0] + P[1] = 0 + P[1] = 1, we know that P[1] = 1.
- Because Q[1] = P[0] + P[1] + P[2] = 0 + 1 + P[2] = 2, we know that P[2] = 1.
- Because Q[2] = P[1] + P[2] + P[3] = 1 + 1 + P[3] = 3, we know that P[3] = 1.
- Repeating these steps gives us P[4] = 0, P[5] = 0, P[6] = 0, P[7] = 1, and P[8] = 1.
- We check our work by noting that Q[8] = P[7] + P[8] = 1 + 1 = 2. Since this equation works out, we are finished, and we have recovered one possible original string.
Now we repeat the process, assuming the opposite about P[0]:
- Assume P[0] = 1.
- Because Q[0] = P[0] + P[1] = 1 + P[1] = 0, we know that P[1] = 0.
- Because Q[1] = P[0] + P[1] + P[2] = 1 + 0 + P[2] = 2, we know that P[2] = 1.
- Now note that Q[2] = P[1] + P[2] + P[3] = 0 + 1 + P[3] = 3, which leads us to the conclusion that P[3] = 2. However, this violates the fact that each character in the original string must be '0' or '1'. Therefore, there exists no such original string P where the first digit is '1'.
Note that this algorithm produces at most two decodings for any given encrypted string. There can never be more than one possible way to decode a string once the first binary digit is set.
Given a string message, containing the encrypted string, return a vector <string> with exactly two elements. The first element should contain the decrypted string assuming the first character is '0'; the second element should assume the first character is '1'. If one of the tests fails, return the string "NONE" in its place. For the above example, you should return {"011100011", "NONE"}.
Definition
Class:BinaryCodeMethod:decodeParameters:stringReturns:vector <string>Method signature:vector <string> decode(string message)(be sure your method is public)
Constraints
-message will contain between 1 and 50 characters, inclusive.-Each character in message will be either '0', '1', '2', or '3'.Examples
0)"123210122"
Returns: { "011100011", "NONE" }
The example from above.
1)"11"
Returns: { "01", "10" }
We know that one of the digits must be '1', and the other must be '0'. We return both cases.
2)"22111"
Returns: { "NONE", "11001" }
Since the first digit of the encrypted string is '2', the first two digits of the original string must be '1'. Our test fails when we try to assume that P[0] = 0.
3)"123210120"
Returns: { "NONE", "NONE" }
This is the same as the first example, but the rightmost digit has been changed to something inconsistent with the rest of the original string. No solutions are possible.
4)"3"
Returns: { "NONE", "NONE" }
5)
"12221112222221112221111111112221111"
Returns: { "01101001101101001101001001001101001", "10110010110110010110010010010110010" }
This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.
class BinaryCode{ public: vector <string> decode(string message) { int a = 0; vector<string> vs; string s1, s2; if(message.size() == 1){ if(message[0] - '0' >= 2){ vs.push_back("NONE"); vs.PB("NONE"); return vs; } else if(message[0] == '0'){ vs.push_back("0"); vs.PB("NONE"); return vs; } else if(message[0] == '1'){ vs.PB("NONE"); vs.PB("1"); return vs; } } int pre1 = 0,pre2 = 0;s1+="0"; for(int i = 0; i < message.size(); i++){ if(message[i] - '0' - pre1 - pre2 == 0 || message[i] - '0' - pre1 - pre2 == 1){ if(i == message.size() - 1){ if(pre1 + pre2 == message[i] - '0'){ continue; } else{ s1 = "NONE"; break; } } else{ s1+=('0'+(message[i] - '0' - pre1 - pre2)); int cmp = pre1; pre1 = pre2; pre2 = (message[i] - '0' - cmp - pre2); } } else{ s1 = "NONE";break; } } //cout<<"s1:"<<s1<<endl; pre1 = 0,pre2 = 1;s2+="1"; for(int i = 0; i < message.size(); i++){ if(message[i] - '0' - pre1 - pre2 == 0 || message[i] - '0' - pre1 - pre2 == 1){ if(i == message.size() - 1){ if(pre1 + pre2 == message[i] - '0'){ continue; } else{ s2 = "NONE"; break; } } else{ s2+=('0'+(message[i] - '0' - pre1 - pre2)); int cmp = pre1; pre1 = pre2; pre2 = (message[i] - '0' - cmp - pre2); } } else{ s2 = "NONE";break; } } vs.PB(s1);vs.PB(s2); return vs; }}
- SRM144_Binary Code_550分题目
- 分三位数题目
- 题目1550:分糖果
- 题目1550:分糖果
- 练习题目-分数字
- 差分约束题目
- 智力题目-01分苹果
- 海盗分宝石逻辑题目
- TC-srm567-500分题目
- 并查集部分题目
- 其他题目---分糖果问题
- topcoder 题目250分(赋答案)
- topcoder 题目750分(赋答案)
- 经典推理题目:海盗分金问题
- 题目1335:闯迷宫(40分)
- Topcoder srm 590 dv2 500分题目
- 九度 题目1550:分糖果
- HDOJ 题目1384 Intervals(差分约束)
- 在查询分析器中显示SQL语句的精确执行时间
- ANSI语法-join小节
- Spring三种实例化Bean的方式
- 遇见未知的自己(二)-冲破身体的屏障
- opencv安装(WinXp平台下,Qt环境)笔记之一—编译动态链接库和静态链接库文件
- SRM144_Binary Code_550分题目
- subveiw中常用的两种判断方法
- ArcGIS Runtime SDK for Android 1.1 搭建开发环境说明
- C# 聊天室 SaveFileDialog 弹不出对话框
- ubuntu下的latex用beamer制作演示文稿时中文书签乱码解决方法
- Spring Bean生命周期
- Eclipse_EclipsePlugin
- linux中编译tslib1.4出错:./autogen.sh: 4: autoreconf: not found
- JS jQuery分别获取选中的复选框值