摘要：
UVA 10118 题意： 有4堆糖果，每堆有n（最多40）个，有一个篮子，最多装5个糖果，我们每次只能从某一堆糖果里拿出一个糖果， 如果篮子里有两个相同的糖果，那么就可以把这两个（一对）糖果放进自己的口袋里，问最多能拿走多少对糖果。糖果种类最多20种. 思路：记忆化搜索 Orz：在输入的时候不小心 阅读全文
摘要：
Input The first line contains an integer T indicating the total number of test cases. Each test case starts with an integer n in one line, then one li 阅读全文
摘要：
Input The first line contains a integer T indicating the total number of test cases. Each test case begins with an integer n, denoting the number of s 阅读全文
摘要：
Input The first line contains an integer T indicating the total number of test cases. Each test case starts with an integer n in one line, then one li 阅读全文
摘要：
Input The first line of input contains an integer T indicating the total number of test cases. The first line of each test case is an integer n, indic 阅读全文
摘要：
Input The first line contains an integer T indicating the total number of test cases. First line of each test case is a line with two integers n,m. Th 阅读全文