更深层次的DFS 解决POJ 2362
摘要：
DescriptionGiven a set of sticks of various lengths, is it possible to join them end-to-end to form a square?InputThe first line of input contains N, the number of test cases. Each test case begins with an integer 4 <= M <= 20, the number of sticks. M integers follow; each gives the length of 阅读全文
posted @ 2011-09-07 08:35 More study needed. 阅读(244) 评论(0) 推荐(0) 编辑
