Master-Mind Hints（思维）

MasterMindisagamefortwoplayers. Oneofthem,Designer,selectsasecretcode. Theother,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. Inorderto breakthecode, Breakermakesanumber ofguesses, eachguessitself beinga 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 s1 …sn and a guess g1 …gn, and are to determine the hint. A hint consists of a pair of numbers determined as follows. A match is a pair (i,j), 1 ≤ i ≤ n and 1 ≤ j ≤ n, such that si = gj. Match (i,j) is called strongwhen i = j, and is called weak otherwise. 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 independent when 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 (thelengthofthecode). Followingthesewillbethesecretcode,representedas 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 ‘0’ (when a value for N would normally be specified). The maximum value for N will be 1000.

Output
Theoutputforeachgameshouldlistthehintsthatwouldbegeneratedforeachguess,inorder,onehint 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)

题意：首先循环输入，等于0结束，然后，给你一个长n矫正数组，然后，下面循环输入，为0时结束，然后让你和矫正数组比较，要是列数相同a++,不相同b++，最后根据格式输出即可(a,b)。

思路：首先，用结构体存储信息，并设置一个标记位f，然后求a时，一个循环就好，记得f的初始化与更改。求b时，嵌套循环，判断没用过才行。

代码：

#include
using namespace std;
#define maxn 1005
typedef struct s
{
    int num;
    int f;
}s;
s sr[maxn],gs[maxn];
int n,i,j,a,b;
int main()
{
	int t=1;
    while(cin>>n&&n)
    {
    	for(int i=0;i>sr[i].num;
    		sr[i].f=0;
		}
		cout<<"Game "<>gs[i].num;
				gs[i].f=0;
				sr[i].f=0;
				if(gs[i].num==0) cnt++;
			}	
			if(cnt==n) break;
			for(int i=0;i