UVa - 340 - Master-Mind Hints

题目大意：

猜数字游戏。

先输入n，表示要猜的数字个数。（当n为0 时结束）

接下来第一行为要才猜的数字排序（数字为1 到9）。

接下来的多行知道都为0，为对手所猜的。

那我们要求的一个是位置与数字都相同的个数，以及数字相同但位置不同的个数。

注：每个数字只能被比较一次。位置与数字都相同的优先级最高。

如 ：

1  2  3  6  6 6 

6 6  6  7  7  7

答案为   0   3

1 2 3  6 6 6

7 6 6 6 7 7

答案为  1  2

1 2 3 6 6 6

7 7 6 6 7 7

答案为 1 1

1 2 3 6 6 7

6 6 6 5 5 5 

答案为 0 2  （每个数字只能被比较一次）

1 2 3 6 77

666 555

答案为 0 1

转化下，做法就很简单。

先比较位置与数字都相同的， 得出个数，然后标记为0。

然后1到9 循环 

如：

我们先看1 的

找出要猜的1的个数， 及所猜中1的个数，然后取数值较小的。

然后将1到9所得的加起来即的答案。

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define N 1100

using namespace std;

int Min(int x, int y)
{
	return x < y ? x : y;
}

int main()
{
	int n, h = 0, i, j, k, ans, end1, end2, a, b;
	int arr[N], arr1[N], arr2[N];
	while (scanf("%d", &n) && n!= 0)
	{
		h ++;
		memset(arr, 0, sizeof(arr));
		memset(arr1, 0, sizeof(arr1));
		memset(arr2, 0, sizeof(arr2));
		for (i = 0; i < n; i ++)
		{
			scanf("%d", &arr1[i]);
		}
		printf("Game %d:\n", h);
		while (1)
		{
			ans = 0;
			end1 = 0;
		    end2 = 0;	
			a = 0;
			b = 0;
			for (i = 0; i < n; i ++)
			{
				arr2[i] = arr1[i];
			}
			for (i = 0; i < n; i ++)
			{
				scanf("%d", &arr[i]);
				if (arr[i] == 0)
				{
					ans ++;
				}
			}
			if (ans == n)
			{
				break;
			}
			for (i = 0; i < n; i ++)//找位置与数字都相同的，并标记为0
			{
				if (arr[i] == arr2[i])
				{
					end1 ++;
					arr[i] = 0;
					arr2[i] = 0;
				}
			}
			for (i = 1; i <= 9; i ++)//找数字相同位置不同的
			{
				for (j = 0; j < n; j ++)
				{
					if (arr[j] == i)
					{
						a ++;
					}
				}
				for (j = 0; j < n; j ++)
				{
					if (arr2[j] == i)
					{
						b ++;
					}
				}
				end2 += Min(a, b);
				a = 0; 
				b = 0;
			}
			printf("    (%d,%d)\n", end1, end2);
		}
	}
	return 0;
}

Master-Mind Hints

MasterMind is a game for two players. One of them, Designer, selects a secret code. The other, Breaker, tries to break it. A code is no more than a row of colored dots. At the beginning of a game, the players agree upon the length N that a code must have and upon the colors that may occur in a code.

In order to break the code, Breaker makes a number of guesses, each guess itself being a code. After each guess Designer gives a hint, stating to what extent the guess matches his secret code.

In this problem you will be given a secret code  and a guess  , and are to determine the hint. A hint consists of a pair of numbers determined as follows.

A match is a pair (i,j),  and  , such that  . Match (i,j) is called strong when i = j, and is called weakotherwise. Two matches (i,j) and (p,q) are called independent when i = p if and only if j = q. A set of matches is called independentwhen all of its members are pairwise independent.

Designer chooses an independent set M of matches for which the total number of matches and the number of strong matches are both maximal. The hint then consists of the number of strong followed by the number of weak matches in M. Note that these numbers are uniquely determined by the secret code and the guess. If the hint turns out to be (n,0), then the guess is identical to the secret code.

Input

The input will consist of data for a number of games. The input for each game begins with an integer specifying N (the length of the code). Following these will be the secret code, represented as N integers, which we will limit to the range 1 to 9. There will then follow an arbitrary number of guesses, each also represented as N integers, each in the range 1 to 9. Following the last guess in each game will be N zeroes; these zeroes are not to be considered as a guess.

Following the data for the first game will appear data for the second game (if any) beginning with a new value for N. The last game in the input will be followed by a single zero (when a value for N would normally be specified). The maximum value for N will be 1000.

Output

The output for each game should list the hints that would be generated for each guess, in order, one hint per line. Each hint should be represented as a pair of integers enclosed in parentheses and separated by a comma. The entire list of hints for each game should be prefixed by a heading indicating the game number; games are numbered sequentially starting with 1. Look at the samples below for the exact format.

Sample Input

4
1 3 5 5
1 1 2 3
4 3 3 5
6 5 5 1
6 1 3 5
1 3 5 5
0 0 0 0
10
1 2 2 2 4 5 6 6 6 9
1 2 3 4 5 6 7 8 9 1
1 1 2 2 3 3 4 4 5 5
1 2 1 3 1 5 1 6 1 9
1 2 2 5 5 5 6 6 6 7
0 0 0 0 0 0 0 0 0 0
0

Sample Output

Game 1:
    (1,1)
    (2,0)
    (1,2)
    (1,2)
    (4,0)
Game 2:
    (2,4)
    (3,2)
    (5,0)
    (7,0)