题目:http://community.topcoder.com/stat?c=problem_statement&pm=10554&rd=15855 符合条件的集中非1的元素个数是非常少的,能够用回溯加剪枝.实际执行速度非常快. 代码: #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <iostream&…

题目:http://community.topcoder.com/stat? c=problem_statement&pm=10409&rd=15854 利用高斯消元求线性空间的基,也就是求矩阵的秩. 代码: #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <iostream> #include &l…

称号:http://community.topcoder.com/stat? c=problem_statement&pm=13143&rd=15853 參考:http://apps.topcoder.com/wiki/display/tc/SRM+620 又是一道关于概率的题目,考虑dp方法.关键是找准突破口,将题目条件的"至少有一个大于4的连通图"转换为"全部连通图都小于等于3". 代码: #include <algorithm> #…

Given a collection of integers that might contain duplicates, nums, return all possible subsets. Note: Elements in a subset must be in non-descending order. The solution set must not contain duplicate subsets. For example,If nums = [1,2,2], a solutio…

关于斐波那契数列,由于数据量比较小, 直接打表了,代码写的比较戳 #include <iostream> #include <vector> #include <algorithm> using namespace std; class FibonacciDiv2{ public: vector<int> table; void make_table(){ table.push_back(); table.push_back(); ; do{ ; newDa…

注意题目这句话,Once you have each type of candies in a box, you want to pack those boxes into larger boxes, until only one box remains. 两个box合并后必须放入更大一个盒子 题目的有点类似huffman的前部分,此题用堆去做,由于priority_queue是用堆实现的,故可以直接使用 每次从堆中选取最小的两个进行合并即可 #include <iostream> #incl…

题目:http://community.topcoder.com/stat?c=problem_statement&pm=13204&rd=15857 这道题目须要用到博弈论中的经典理论,Sprague–Grundy theorem,以下将相关理论做一个总结: Impartial Game:公平游戏,两方除了谁先開始游戏外,其余都同样. Nim:一类经典的Impartial Game,非常多游戏都能够等价于Nim. Nimber(Grundy numbers):能够理解为标识一个游戏状态的…

称号:c=problem_statement&pm=13283&rd=16009">http://community.topcoder.com/stat?c=problem_statement&pm=13283&rd=16009 參考:http://apps.topcoder.com/wiki/display/tc/SRM+628 開始不知道怎么求期望.普通方法 p1*c1 + p2 *c2 + ... 行不通,看了Editoral才发现原来能够用dp的方法…

Given a set of distinct integers, nums, return all possible subsets. Note: Elements in a subset must be in non-descending order. The solution set must not contain duplicate subsets. For example,If nums = [1,2,3], a solution is: [ [3], [1], [2], [1,2,…

Cognition math based on Factor Space Wang P Z1, Ouyang H2, Zhong Y X3, He H C4 1Intelligence Engineering and Math Institute, Liaoning Technical Univ. Fuxin, Liaoning, 123000, China 2Jie Macroelectronics co. Ltd, Shanghai, 200000, China 3 I & CE Colle…