AC，∑ndless

B. Young Table http://codeforces.com/problemset/problem/237%2FB time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output

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

Red and Black http://poj.org/problem?id=1979 Time Limit: 1000MS Memory Limit: 30000K Description There is a rectangular room, covered with square tiles. Each tile is colored eit

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

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

Dungeon Master http://poj.org/problem?id=2251 Time Limit: 1000MS Memory Limit: 65536K Description You are trapped in a 3D dungeon and need to find the quickest way out! The dung

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

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

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

Prime Path http://poj.org/problem?id=3126 Time Limit: 1000MS Memory Limit: 65536K Description The ministers of the cabinet were quite upset by the message from the Chief of Secu

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

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

http://codeforces.com/problemset/problem/116/C 从树根DFS，看最大能递归几层。 /*30ms,300KB*/ #include using 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*/ #include const 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 Order Time 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 Swaps Time limit: 3.000 seconds  http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108&page=show_problem&problem=267 Sorting an array can be done b

A. Puzzles http://codeforces.com/contest/337/problem/A time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Th

学英语： 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 Moves Time limit: 3.000 seconds http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=105&page=show_problem&problem=380 http://acm.hdu.edu.cn/showproblem.php?

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

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

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

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

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

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

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

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

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

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

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

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