uva 11205 The Broken Pedometer

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 ofN 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

题目大意：给出记步器，计算最少需要多少灯来表示所给的记步器，（无重复）输出最少的灯数。

解题思路：先枚举灯数，然后再由灯数枚举所有组成情况，如果当中有一组符合要求，即是当前灯数，否则灯数+1.

#include<stdio.h>
#include<string.h>
#define N 101
#define M 101

int n, m;
int map[N][M];
int num[3] = {7, 3, 1};
int tem[M];

int judge(int a, int b, int sum)
{
	for(int i = 1; i <= sum ;i++)
	{
		if(map[a][tem[i]] != map[b][tem[i]])
			return 0;
	}
	return 1;
}

int find(int k)
{
	for(int a = 0; a < n; a++)
		for(int b = a + 1; b < n; b++)
			if( judge(a, b, k) )
				return 0;
return 1;
}

int build(int sum, int k)
{
	if(sum != k - 1)
	{
		for(tem[k] = tem[k - 1] + 1; tem[k] < m; tem[k]++)
			if(build(sum, k + 1))
					return 1;
	}
	else
	{
		if(find(sum))
			return 1;
	}
	return 0;
}

int main()
{
	int t;
	scanf("%d", &t);

	while(t--)
	{
		// Init.
		memset(map, 0, sizeof(map));

		// Read.
		scanf("%d%d", &m, &n);
		for(int i = 0; i < n; i++)
			for(int j = 0; j < m; j++)
				scanf("%d", &map[i][j]);

/*		// Find the Min.
		int min;
		for(int i = 0; i < 3; i++)
			if(m > num[i])
			{
				min = 4 - i;
				break;
			}
*/		
		// Count.
		int i;
		for(i = 0; i <= m; i++)
		{
			memset(tem, 0, sizeof(tem));
			tem[0] = -1;
			if(build(i,1))		break;
		}

		printf("%d\n", i);
	}
return 0;
}