連結:http://poj.org/problem?id=1679題目:DescriptionGiven a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a subgraph of G,
連結:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=1281原題:You have devised a new encryption technique which encodes a message by inserting between its characters randomly
連結:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1310題目:Problem C: Arctic NetworkThe Department of National Defence (DND) wishes to connect several northern outposts by a
連結:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=247原題:A factory produces products packed in square packets of the same height h and of the sizes , , , , , . These
【連結】http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=1659【原題】In bit-wise expression, mask is a common term. You can get a certain bit-pattern using mask. For example, if you
題目連結:http://acm.hdu.edu.cn/showproblem.php?pid=1558題目類型: 計算集合 , 並查集題目:A segment and all segments which are connected with it compose a segment set. The size of a segment set is the number of segments in it. The problem is to find the size of some
題目連結:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_problem&problem=237題目類型: 回溯法原題:Ruratania is just entering capitalism and is establishing new enterprising activities in many fields including transport.