AC，∑ndless

B. Young Tablehttp://codeforces.com/problemset/problem/237%2FBtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output

10717 - MintTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=115&page=show_problem&problem=1658The Royal Canadian Mint has commissioned a

Red and Blackhttp://poj.org/problem?id=1979Time Limit: 1000MSMemory Limit: 30000KDescriptionThere is a rectangular room, covered with square tiles. Each tile is colored eit

12124 - AssembleTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=3276Recently your team noticed that the

1267 - NetworkTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=3708Consider a tree network with n nodes w

Dungeon Masterhttp://poj.org/problem?id=2251Time Limit: 1000MSMemory Limit: 65536KDescriptionYou are trapped in a 3D dungeon and need to find the quickest way out! The dung

11210 - Chinese MahjongTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=2151Mahjong () is a game of Chinese origin usually played by

1335 - Beijing GuardsTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=4081Beijing was once surrounded by

10308 - Roads in the NorthTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=115&page=show_problem&problem=1249思路：由于是一棵树，我们只要随便指定一个树根就开

Prime Pathhttp://poj.org/problem?id=3126Time Limit: 1000MSMemory Limit: 65536KDescriptionThe ministers of the cabinet were quite upset by the message from the Chief of Secu

167 - The Sultan's SuccessorsTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_problem&problem=103The Sultan of Nubia has n

http://codeforces.com/contest/371/problem/C直接二分能做的汉堡数，注意上界要开大一点。完整代码：/*15ms,0KB*/#includeusing namespace std;const long long mx = 1e13;///多开一位，因为结果可以略大于1e12const char b[] = "BSC";

http://codeforces.com/problemset/problem/116/C从树根DFS，看最大能递归几层。/*30ms,300KB*/#includeusing namespace std;const int mx = 2005;vector v[mx];bool fa[mx];int maxlen;void dfs(int i, int

http://codeforces.com/problemset/problem/116/D/*30ms,0KB*/#includeconst int mx = 155;char g[mx][mx];int left[mx], right[mx];int main(){ int n, m, i, j, posy, dir; int cnt = -1; scanf

200 - Rare OrderTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=136题意：给一列单词，这些单词是按一种未知的字典顺序排列的，要求输出这些字母

331 - Mapping the SwapsTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_problem&problem=267Sorting an array can be done b

A. Puzzleshttp://codeforces.com/contest/337/problem/Atime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTh

学英语：1. Match (i,j) is called strong when i =j, and is called weak otherwise.当i=j时，匹配(i,j)被叫做强匹配，反之叫做弱匹配。2. Two matches (i,j) and (p,q) are called independent when i = p if and only if j = q. A set of matches is called independent when all of its members

439 - Knight MovesTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=105&page=show_problem&problem=380http://acm.hdu.edu.cn/showproblem.php?

524 - Prime Ring ProblemTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=465A ring is composed of n (even number) circl

129 - Krypton FactorTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=65You have been employed by the organisers of a Super Krypton F

10344 - 23 out of 5Time limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1285Your task is to write a program t

110 - Meta-Loopless SortsTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=46Background Sorting holds an im

10474 - Where is the Marble?Time limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_problem&problem=1415Raju and Meena love to pl

10562 - Undraw the TreesTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=104&page=show_problem&problem=1503Professor Homer has been rep

839 - Not so MobileTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=104&page=show_problem&problem=780Before being an ubiquous communica

639 - Don't Get RookedTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_problem&problem=580In chess, the rook is a piece t

699 - The Falling LeavesTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=640Each year, fall in the North Central regio

140 - BandwidthTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_problem&problem=76Given a graph (V,E) where V is a set of

548 - TreeTime limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=104&page=show_problem&problem=489You are to determine the value of the leaf

http://codeforces.com/contest/339/problem/C爆搜水过，复杂度貌似是O(m)的？/*62ms,4KBm*/#includeint m, ans[1005]; ///ans从1开始char s[15];bool ok;///O(m)复杂度？int dfs(int deep, int diff) /// diff表示重量之差{