srm 144 div 2 550

最新推荐文章于 2020-06-04 19:05:13 发布
最新推荐文章于 2020-06-04 19:05:13 发布
阅读量797 收藏
点赞数
CC 4.0 BY-SA版权
分类专栏： ACM算法题 文章标签： srm
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.youkuaiyun.com/littlefool5201314/article/details/9334329
本文介绍了一种用于解码二进制消息的算法实现。该算法通过遍历输入字符串并利用特定规则来尝试还原原始的二进制编码。文章提供了一个名为`BinaryCode`的类，该类包含一个`decode`方法，可以处理不同类型的输入，并返回可能的解码结果。 
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>

using namespace std;

class BinaryCode {
public:
	vector <string> decode(string message)
	{
        string p;
        char c;
        int t,i,j=0;
        vector <string> result;
        result.push_back( "NONE" );
        result.push_back( "NONE" );
        message.insert(message.begin(),'0');
        message.insert(message.end(),'0');
        while(j<2)
        {
            p=message;
            p[1]=j+'0';t=0;
            for(i=2;i<message.length()-1;i++)
            {
                p[i]=message[i-1]-p[i-2]-p[i-1]+'0'+'0';
                if(p[i]<'0'||p[i]>'1')
                {t=1;break;}
            }
            if(!t)
            {
                p.erase(0,1);
                p.erase(i-1,1);
                result[j]=p;
                i=message.length()-2;
                c=message[i];
                if(i!=1)
                {
                    if(c!=p[i-1]+p[i-2]-'0')
                    result[j]="NONE";
                }
                else if(c!=p[i-1]) result[j]="NONE";
            }
            j++;
        }
        return result;
	}
};
//<%:start-tests%>
double test0() {
	string p0 = "123210122";
	BinaryCode * obj = new BinaryCode();
	clock_t start = clock();
	vector <string> my_answer = obj->decode(p0);
	clock_t end = clock();
	delete obj;
	cout <<"Time: " <<(double)(end-start)/CLOCKS_PER_SEC <<" seconds" <<endl;
	string t1[] = { "011100011",  "NONE" };
	vector <string> p1(t1, t1+sizeof(t1)/sizeof(string));
	cout <<"Desired answer: " <<endl;
	cout <<"\t{ ";
	if (p1.size() > 0) {
		cout <<"\""<<p1[0]<<"\"";
		for (int i=1; i<p1.size(); i++)
			cout <<", \"" <<p1[i]<<"\"";
		cout <<" }" <<endl;
	}
	else
		cout <<"}" <<endl;
	cout <<endl <<"Your answer: " <<endl;
	cout <<"\t{ ";
	if (my_answer.size() > 0) {
		cout <<"\""<<my_answer[0]<<"\"";
		for (int i=1; i<my_answer.size(); i++)
			cout <<", \"" <<my_answer[i]<<"\"";
		cout <<" }" <<endl;
	}
	else
		cout <<"}" <<endl;
	if (my_answer != p1) {
		cout <<"DOESN'T MATCH!!!!" <<endl <<endl;
		return -1;
	}
	else {
		cout <<"Match :-)" <<endl <<endl;
		return (double)(end-start)/CLOCKS_PER_SEC;
	}
}
double test1() {
	string p0 = "11";
	BinaryCode * obj = new BinaryCode();
	clock_t start = clock();
	vector <string> my_answer = obj->decode(p0);
	clock_t end = clock();
	delete obj;
	cout <<"Time: " <<(double)(end-start)/CLOCKS_PER_SEC <<" seconds" <<endl;
	string t1[] = { "01",  "10" };
	vector <string> p1(t1, t1+sizeof(t1)/sizeof(string));
	cout <<"Desired answer: " <<endl;
	cout <<"\t{ ";
	if (p1.size() > 0) {
		cout <<"\""<<p1[0]<<"\"";
		for (int i=1; i<p1.size(); i++)
			cout <<", \"" <<p1[i]<<"\"";
		cout <<" }" <<endl;
	}
	else
		cout <<"}" <<endl;
	cout <<endl <<"Your answer: " <<endl;
	cout <<"\t{ ";
	if (my_answer.size() > 0) {
		cout <<"\""<<my_answer[0]<<"\"";
		for (int i=1; i<my_answer.size(); i++)
			cout <<", \"" <<my_answer[i]<<"\"";
		cout <<" }" <<endl;
	}
	else
		cout <<"}" <<endl;
	if (my_answer != p1) {
		cout <<"DOESN'T MATCH!!!!" <<endl <<endl;
		return -1;
	}
	else {
		cout <<"Match :-)" <<endl <<endl;
		return (double)(end-start)/CLOCKS_PER_SEC;
	}
}
double test2() {
	string p0 = "22111";
	BinaryCode * obj = new BinaryCode();
	clock_t start = clock();
	vector <string> my_answer = obj->decode(p0);
	clock_t end = clock();
	delete obj;
	cout <<"Time: " <<(double)(end-start)/CLOCKS_PER_SEC <<" seconds" <<endl;
	string t1[] = { "NONE",  "11001" };
	vector <string> p1(t1, t1+sizeof(t1)/sizeof(string));
	cout <<"Desired answer: " <<endl;
	cout <<"\t{ ";
	if (p1.size() > 0) {
		cout <<"\""<<p1[0]<<"\"";
		for (int i=1; i<p1.size(); i++)
			cout <<", \"" <<p1[i]<<"\"";
		cout <<" }" <<endl;
	}
	else
		cout <<"}" <<endl;
	cout <<endl <<"Your answer: " <<endl;
	cout <<"\t{ ";
	if (my_answer.size() > 0) {
		cout <<"\""<<my_answer[0]<<"\"";
		for (int i=1; i<my_answer.size(); i++)
			cout <<", \"" <<my_answer[i]<<"\"";
		cout <<" }" <<endl;
	}
	else
		cout <<"}" <<endl;
	if (my_answer != p1) {
		cout <<"DOESN'T MATCH!!!!" <<endl <<endl;
		return -1;
	}
	else {
		cout <<"Match :-)" <<endl <<endl;
		return (double)(end-start)/CLOCKS_PER_SEC;
	}
}
double test3() {
	string p0 = "123210120";
	BinaryCode * obj = new BinaryCode();
	clock_t start = clock();
	vector <string> my_answer = obj->decode(p0);
	clock_t end = clock();
	delete obj;
	cout <<"Time: " <<(double)(end-start)/CLOCKS_PER_SEC <<" seconds" <<endl;
	string t1[] = { "NONE",  "NONE" };
	vector <string> p1(t1, t1+sizeof(t1)/sizeof(string));
	cout <<"Desired answer: " <<endl;
	cout <<"\t{ ";
	if (p1.size() > 0) {
		cout <<"\""<<p1[0]<<"\"";
		for (int i=1; i<p1.size(); i++)
			cout <<", \"" <<p1[i]<<"\"";
		cout <<" }" <<endl;
	}
	else
		cout <<"}" <<endl;
	cout <<endl <<"Your answer: " <<endl;
	cout <<"\t{ ";
	if (my_answer.size() > 0) {
		cout <<"\""<<my_answer[0]<<"\"";
		for (int i=1; i<my_answer.size(); i++)
			cout <<", \"" <<my_answer[i]<<"\"";
		cout <<" }" <<endl;
	}
	else
		cout <<"}" <<endl;
	if (my_answer != p1) {
		cout <<"DOESN'T MATCH!!!!" <<endl <<endl;
		return -1;
	}
	else {
		cout <<"Match :-)" <<endl <<endl;
		return (double)(end-start)/CLOCKS_PER_SEC;
	}
}
double test4() {
	string p0 = "3";
	BinaryCode * obj = new BinaryCode();
	clock_t start = clock();
	vector <string> my_answer = obj->decode(p0);
	clock_t end = clock();
	delete obj;
	cout <<"Time: " <<(double)(end-start)/CLOCKS_PER_SEC <<" seconds" <<endl;
	string t1[] = { "NONE",  "NONE" };
	vector <string> p1(t1, t1+sizeof(t1)/sizeof(string));
	cout <<"Desired answer: " <<endl;
	cout <<"\t{ ";
	if (p1.size() > 0) {
		cout <<"\""<<p1[0]<<"\"";
		for (int i=1; i<p1.size(); i++)
			cout <<", \"" <<p1[i]<<"\"";
		cout <<" }" <<endl;
	}
	else
		cout <<"}" <<endl;
	cout <<endl <<"Your answer: " <<endl;
	cout <<"\t{ ";
	if (my_answer.size() > 0) {
		cout <<"\""<<my_answer[0]<<"\"";
		for (int i=1; i<my_answer.size(); i++)
			cout <<", \"" <<my_answer[i]<<"\"";
		cout <<" }" <<endl;
	}
	else
		cout <<"}" <<endl;
	if (my_answer != p1) {
		cout <<"DOESN'T MATCH!!!!" <<endl <<endl;
		return -1;
	}
	else {
		cout <<"Match :-)" <<endl <<endl;
		return (double)(end-start)/CLOCKS_PER_SEC;
	}
}
double test5() {
	string p0 = "12221112222221112221111111112221111";
	BinaryCode * obj = new BinaryCode();
	clock_t start = clock();
	vector <string> my_answer = obj->decode(p0);
	clock_t end = clock();
	delete obj;
	cout <<"Time: " <<(double)(end-start)/CLOCKS_PER_SEC <<" seconds" <<endl;
	string t1[] = { "01101001101101001101001001001101001",  "10110010110110010110010010010110010" };
	vector <string> p1(t1, t1+sizeof(t1)/sizeof(string));
	cout <<"Desired answer: " <<endl;
	cout <<"\t{ ";
	if (p1.size() > 0) {
		cout <<"\""<<p1[0]<<"\"";
		for (int i=1; i<p1.size(); i++)
			cout <<", \"" <<p1[i]<<"\"";
		cout <<" }" <<endl;
	}
	else
		cout <<"}" <<endl;
	cout <<endl <<"Your answer: " <<endl;
	cout <<"\t{ ";
	if (my_answer.size() > 0) {
		cout <<"\""<<my_answer[0]<<"\"";
		for (int i=1; i<my_answer.size(); i++)
			cout <<", \"" <<my_answer[i]<<"\"";
		cout <<" }" <<endl;
	}
	else
		cout <<"}" <<endl;
	if (my_answer != p1) {
		cout <<"DOESN'T MATCH!!!!" <<endl <<endl;
		return -1;
	}
	else {
		cout <<"Match :-)" <<endl <<endl;
		return (double)(end-start)/CLOCKS_PER_SEC;
	}
}
//<%:end-tests%>
int main() {
	int time;
	bool errors = false;

	time = test0();
	if (time < 0)
		errors = true;

	time = test1();
	if (time < 0)
		errors = true;

	time = test2();
	if (time < 0)
		errors = true;

	time = test3();
	if (time < 0)
		errors = true;

	time = test4();
	if (time < 0)
		errors = true;

	time = test5();
	if (time < 0)
		errors = true;

	if (!errors)
		cout <<"You're a stud (at least on the example cases)!" <<endl;
	else
		cout <<"Some of the test cases had errors." <<endl;
}



//<%:testing-code%>
//Powered by [KawigiEdit] 2.0!

TopCoder SRM 144 DIV2 550points
fcbruce
02-11 859
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 exampl
TC SRM566 DIV2 T3 FencingPenguinsEasy
CaptainSlow
08-27 376
前言 头一道计算几何题，现学现用… 题目描述 En Paco collects penguins. His penguins like to play and run around on the ice where he lives. In order to keep his penguins safe he decided to construct a single ...
SRM144 DIV2 550
weixin_30633405的博客
11-25 86
同DIV1-300 转载于:https://www.cnblogs.com/valaxy/p/3440804.html
Top Coder Arena SRM 144 DIV 2 550point
dark19940411的专栏
11-29 651
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 a
TopCoder SRM 144 DIV 2
Charlie Pan's Blog
08-28 1093
200: Problem Statement   Computers tend to store dates and times as single numbers which represent the number of seconds or milliseconds since a particular date. Your task in this
Topcoder SRM144 div2 1100
无奈滴微笑
12-05 740
题意：大概是一个电力公司停电了，要检修下水道里的变压器，每两个变压器有一条路径相通（双向的），然后有花费的时间，然后只有一个检修人员从第一个变压器出发，问遍历所有变压器最少需要多长时间。 题解：典型的树状DP.我们把第一个变压器当做根节点（I AM Groot）然后有N个互不相通的儿子，我们肯定是走N-1个儿子走两次，而1个儿子只走一次。我们可以枚举只走一次的儿子，其他儿子走两次进行深搜DFS就可以了。
topcoder 记录 srm 144 div2
zhyh1435589631的专栏
11-15 847
代码测试结果： [TEST CASE #1]: Success: true Status: 0 Return value: 0:0:0 Correct example: true Execution time (ms): 0 Peak memory used (KB): 11888 [TEST CASE #2]: Success: true Status: 0 Ret
SRM 144 DIV2
多看多听多总结
06-05 534
 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 dig
SRM144 DIV2
多看多听多总结
06-05 708
Problem Statement      Computers tend to store dates and times as single numbers which represent the number of seconds or milliseconds since a particular date. Your task in this p
TopCoder SRM 144 DIV1 550 Lottery
Moor的专栏
03-25 521
题意： 用四个参数描述了彩票的规则：数字范围，数字个数，是否要按递增顺序，是否数字要唯一。 题解： 模拟…… import java.io.File; import java.io.FileInputStream; import java.io.FileNotFoundException; import java.io.InputStream; import java.util.*
Topcoder SRM 144 Div1 550(数学和dp问题求方案数，很有意思)
peteryuanpan的专栏
09-13 760
Problem Statement   In most states, gamblers can choose from a wide variety of different lottery games. The rules of a lottery are defined by two integers (choices and blanks) and two bool
TC SRM 388 div 2 problem 3
04-16
topcoder的数学类算法题目。一个整数被称为k-smooth当且仅当它的最大素因子不大于k，给定N和K，计算出1 - N中有多少个整数是k-smooth。1 , 1 <= K <= 1000.
TC SRM567 DIV2 T3 MountainsEasy
CaptainSlow
08-11 781
前言 TC百题计划，走起！ 题目描述 今有一图青山绿水，山神安山NNN座。重峦叠嶂，峰峰起伏如此： For 0 &lt;= i &lt; N: For 0 &lt;= x &lt; W: For 0 &lt;= y &lt;= Y[i] - |x - X[i]|: pix[x, y] := 'X' 即是： ..X... .XX...
递归和动态规划的区别
OuterST
06-04 3169
递归：自上至下，把大问题分解成小问题解决。 动态规划：自下至上，通过解决小问题，集合为解决大问题。 用递归能解决的问题，一般都可以用动态规划来解决。 区别： 递归： 缺点：会重复计算相同的问题，相当耗时。 优点：不会记录每个问题的结果，所以内存消耗相对小。 动态规划：缺点：会记录每一个问题的结果，内存消耗较大。 优点：不会计算相同问题，时间消耗较小。 ...
ios 8 地图定位
OuterST
10-10 1762
在xcode6中 苹果地图得定位方法修改了，以前得不能用了 报错说明：Trying to start MapKit location updates without prompting for location authorization. Must call -[CLLocationManager requestWhenInUseAuthorization] or -[CLLocationMa
poj 3038
OuterST
09-14 1584
【搜索题】题目链接dfs +bfs按左拐，按右拐，最短路径，dfs时坐标不要弄错判断的时候不要吧!vis写成visbfs fir 表示以当前节点查找，sec表示与fir相连且没访问过的从开始点开始查找第一层，找到一个节点，加到队列末尾，没有节点了，就fir++,从下一结点查找 #include &lt;cstdio&gt; #include &lt;cstring&gt; #define N 50...
hdu 2077
OuterST
08-15 1378
题目链接 盘子分为A,B,C 汉诺塔III的公式:f[n]=f[n-1]*3+2=3^n-1 另g(n)=3^n-1，表示n个盘子从A到C按照III的规律执行的次数 按IV的规律，最优的情况是n-2个盘子先按III的规律到C，n-1,n依次到B，n-2个再到A，n-1,n到C，n-2再到C f1[n]=g(n-2)*3+4=3^n+1=f[n-1]*3-2; #include
HDU 2058
OuterST
09-10 1361
【算法设计】这题用等差数列来计算先求数列的长度Problem DescriptionGiven a sequence 1,2,3,......N, your job is to calculate all the possible sub-sequences that the sum of the sub-sequence is M.InputInput contains multiple tes...
hdu 2065
OuterST
08-12 1351
【水题】wa了一次，打表出错了，汗 ，PE 2次，格式啊，，不够认真。递推题，一直是比较乏力，碰到找规律就头疼啊f[i][0]=满足条件; f[i][1]=仅有奇数个A;f[i][2仅]有奇数个C;f[i][3]有奇数个A和C;先推导公式，在找到循环次数，一般这种都有循环次数吧题目链接#include &lt;cstdio&gt; #include &lt;cstring&gt; using na...
SACMA SRM01 中文版
最新发布
05-25
### 关于 SACMA SRM01 的中文版资料 SACMA SRM01 是由复合材料学会（Society for the Advancement of Material and Process Engineering, SAMPE）发布的标准之一，主要用于描述短切玻璃纤维增强热固性模塑料的性能测试方法[^1]。该标准通常涉及材料特性、制备工艺以及质量控制等方面的内容。 对于寻找 SACMA SRM01 中文版文档的需求，可以通过以下途径获取： #### 1. 官方渠道 SAMPE 或其中国分会可能提供官方翻译版本的下载服务。建议访问 SAMPE China 的官方网站或其他授权机构网站查询是否有正式的中文译本[^2]。 #### 2. 图书馆资源 部分高校图书馆或行业技术中心会收藏此类国际标准的技术文件及其翻译件。可以联系所在地区的科技图书馆或者通过 Interlibrary Loan (ILL) 请求借阅相关文献[^3]。 #### 3. 商业平台购买 一些商业数据库如 CNKI（知网）、万方数据等可能会收录经过合法授权的标准翻译版本。如果这些平台上未找到具体条目，则需进一步确认是否已发布官方认可的中文版本[^4]。 以下是基于 Python 编写的简单脚本来演示如何自动化搜索某些在线学术资源库中的关键词匹配项： ```python import requests from bs4 import BeautifulSoup def search_sacma(keyword="SACMA SRM01"): url = f"https://example-academic-resource.com/search?q={keyword}" response = requests.get(url) soup = BeautifulSoup(response.text, 'html.parser') results = [] for item in soup.find_all('div', class_='result-item'): title = item.find('h3').text.strip() link = item.find('a')['href'] abstract = item.find('p', class_='abstract').text.strip()[:150]+'...' results.append({ "title": title, "link": link, "abstract": abstract }) return results if __name__ == "__main__": res = search_sacma("SACMA SRM01") for r in res: print(f"{r['title']}\n{r['link']}\nAbstract: {r['abstract']}\n---\n") ``` 请注意以上代码仅为示例用途，在实际应用前应调整目标网址并遵循各站点的服务条款与版权政策[^5]。
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值