dfs
文章平均质量分 76
脳漿炸裂
しょうなんの海--who will be with me next time?
展开
-
UVA 211
Thinking: Use dfs to solve this problem. Try all the possibilities row by row. The lay out control is not so clear and you can use udebug to adjust them. AC code:#include #include using nam原创 2016-07-01 11:09:56 · 423 阅读 · 0 评论 -
poj 1011 Sticks
Thinking: 1. Sort the sticks from the longest to the shortest. 2. Among those small sticks, we start from the largest one Smax. The length of the complete stick L should range from Smax to (Sum of原创 2016-08-24 20:06:29 · 393 阅读 · 0 评论