参考资料: https://www.zhihu.com/question/319316132 https://www.reddit.com/r/Piracy/comments/9lk20b/tnt_crack_source/ 在Mac破解软件里经常会看到这样的字样,K'ed by TNT team. 首先K'ed是cracked的缩写,cracked即破解后的 TNT team据传是一个俄罗斯的破解团队,专门破解mac软件的签名许可证之类类. 那么这行字就是说这个破解版的软件是由我们团队(TNT…

A. Dasha and Stairs Problems: 一个按照1,2,3……编号的楼梯,给定踩过的编号为奇数奇数和偶数的楼梯数量a和b,问是否可以有区间[l, r]符合奇数编号有a个,偶数编号有b个. Analysis: cj: 纸张的我=.= 经过Return改正,才发现没有主义a = b = 0的情况. #define PRON "a" #include <cstdio> #include <cstring> #include <vector&g…

H - Football BetsTime Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.hust.edu.cn/vjudge/contest/view.action?cid=87493#problem/H Description While traveling to England, it is impossible not to catch the English passion for football. Almost everyon…

好像又有一个星期没更博客了.. 最近疯狂考试...唯一有点收获的就是学会了莫队这种神奇的算法.. 听起来很难..其实是一个很简单的东西.. 就是在区间处理问题时对于一个待求区间[L',R']通过之前求出的[L,R]更新[L,R+1],[L+1,R],[L,R-1],[L,R-1]的方式弄出答案[L,R]. 比如求[3,5] 我们知道了[1,7],那么我们这样转化 : [1,7]--> [2,7]--> [3,7] --> [3,6] --> [3,5]而求得. 那怎么确定从哪个区间…

Football Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 2769   Accepted: 1413 Description Consider a single-elimination football tournament involving 2n teams, denoted 1, 2, -, 2n. In each round of the tournament, all teams still in the…

续.....TAT这回不到50题编辑器就崩了.. 这里塞40道吧= = bzoj 1585: [Usaco2009 Mar]Earthquake Damage 2 地震伤害 比较经典的最小割?..然而一开始还是不会QAQ 和地震伤害1的区别在于这题求的是最少的损坏牧场数目.把牧场拆点,因为要让1和被报告的点不联通,把1归到S集,被报告的点归到T集,就变成求最小割了. 具体建图: 假设点拆成x和x’,x和x‘间连边(就是等下要割的).被报告的点和1点:容量无穷大(不能割):其他点容量为1. 原图中…

Programming in LuaCopyright ® 2005, Translation Team, www.luachina.net Programming in LuaProgramming in Lua作者:Roberto Ierusalimschy翻译:www.luachina.netSimple is beautifulCopyright ® 2005, Translation Team, www.luachina.net Programming in Luai版权声明 <Pro…

题目 Consider a single-elimination football tournament involving 2n teams, denoted 1, 2, -, 2n. In each round of the tournament, all teams still in the tournament are placed in a list in order of increasing index. Then, the first team in the list plays…

题目链接:http://hihocoder.com/problemset/problem/1608 题解:就是一道简单的状压dp由于dfs过程中只需要几个点之间的转移所以只要预处理一下几个点就行. #include <iostream> #include <cstring> #include <cstdio> #include <queue> using namespace std; << ]; ][] , dr[][] = { , , - ,…

题目链接:http://codeforces.com/contest/828/problem/C 题解:有点意思的题目,可用优先队列解决一下具体看代码理解.或者用并查集或者用线段树都行. #include <iostream> #include <cstring> #include <queue> #include <vector> #include <cstdio> #include <map> #include <strin…