UVA 11205 The broken pedometer

The Problem

A marathon runner uses a pedometer with which he is having problems. In the pedometer the symbols are represented by seven segments (or LEDs):

But the pedometer does not work properly (possibly the sweat affected the batteries) and only some of the LEDs are active. The runner wants to know if all the possible symbols:

can be correctly identified. For example, when the active LEDs are:

numbers 2 and 3 are seen as:

so they cannot be distinguished. But when the active LEDs are:

the numbers are seen as:

and all of them have a different representation.

Because the runner teaches algorithms at University, and he has some hours to think while he is running, he has thought up a programming problem which generalizes the problem of his sweat pedometer. The problem consists of obtaining the minimum number of active LEDs necessary to identify each one of the symbols, given a number P of LEDs, and N symbols to be represented with these LEDs (along with the codification of each symbol).

For example, in the previous sample P = 7 and N = 10. Supposing the LEDs are numbered as:

The codification of the symbols is: "0" = 1 1 1 0 1 1 1; "1" = 0 0 1 0 0 1 0; "2" = 1 0 1 1 1 0 1; "3" = 1 0 1 1 0 1 1; "4" = 0 1 1 1 0 1 0; "5" = 1 1 0 1 0 1 1; "6" = 1 1 0 1 1 1 1; "7" = 1 0 1 0 0 1 1; "8" = 1 1 1 1 1 1 1; "9" = 1 1 1 1 0 1 1. In this case, LEDs 5 and 6 can be suppressed without losing information, so the solution is 5.

The Input

The input file consists of a first line with the number of problems to solve. Each problem consists of a first line with the number of LEDs (P), a second line with the number of symbols (N), and N lines each one with the codification of a symbol. For each symbol, the codification is a succession of 0s and 1s, with a space between them. A 1 means the corresponding LED is part of the codification of the symbol. The maximum value of P is 15 and the maximum value of N is 100. All the symbols have different codifications.

The Output

The output will consist of a line for each problem, with the minimum number of active LEDs necessary to identify all the given symbols.

Sample Input

2
7
10
1 1 1 0 1 1 1
0 0 1 0 0 1 0
1 0 1 1 1 0 1
1 0 1 1 0 1 1
0 1 1 1 0 1 0
1 1 0 1 0 1 1
1 1 0 1 1 1 1
1 0 1 0 0 1 0
1 1 1 1 1 1 1
1 1 1 1 0 1 1
6
10
0 1 1 1 0 0
1 0 0 0 0 0
1 0 1 0 0 0
1 1 0 0 0 0
1 1 0 1 0 0
1 0 0 1 0 0
1 1 1 0 0 0
1 1 1 1 0 0
1 0 1 1 0 0
0 1 1 0 0 0

Sample Output

5
4

题目那么长都是唬人的，其实简单地说，这题就是给你很多个不同01的序列，问最少要选择序列的多少个位置就能区别所有的序列。序列最长为15。这里用二进制运算就方便了很多，直接枚举位置，用且运算即可。
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
int t, n, m, i, j, w, en, k;
int a[200], b[200];

int main(){
	while (scanf("%d", &t) != EOF&&t)
	{
		while (t--)
		{
			cin >> n >> m;
			for (i = 0; i < m;i++)
				for (a[i] = 0, j = 0; j < n; j++)
				{
					scanf("%d", &en);
					a[i] += en << j;
				}
			w = n;
			n = 1 << n;
			for (i = 1; i <= n; i++)
			{
				for (j = 0; j < m; j++) b[j] = a[j] & i;
				sort(b, b + m);
				for (j = 1; j < m; j++) if (b[j]==b[j-1]) break;
				if (j == m)
				{
					for (j = 0, k = i; k>0; k /= 2) if (k & 1) j++;
					w = min(w, j);
				}
			}
			cout << w << endl;
		}
	}
	return 0;
}
熟练掌握二进制的运算也是很重要的。