Woburn Team Practice '07
A cow has just issued you a challenge! You are given a list of N (1 ≤ N ≤ 100) possibly empty bitstrings (i.e., strings consisting of only 0s and 1s), whose lengths do not exceed 50. You are also given n0 zeroes (0 ≤ n0 ≤ 300) and n1 ones (0 ≤ n1 ≤ 300) at your disposal. The cow wants to know the maximum number of bitstrings in the list that you can create using those 0s and 1s. Of course, once you use a 0 or 1, you cannot use it again.
The first line of the input file contains a single integer T (1 ≤ T ≤ 10), indicating the number of testcases to follow.
Each testcase begins with a single line listing the integers N, n0, and n1 as described above. The next N lines list the bitstrings in your list. The bitstrings don't appear in any particular order, and may contain duplicates.
A single integer that is the maximum number of bitstrings you can create.
2 3 3 1 00 1 100 3 2 4 00 101 110
Case 1: You can create the first two bitstrings in the list.
Case 2: Make the last two bitstrings this time!
Point Value: 10 (partial)
Time Limit: 2.00s
Memory Limit: 16M
Added: Aug 25, 2010
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3