UVA - 340 Master-Mind Hints

Master-Mind Hints

Time Limit: 3000MS  64bit IO Format: %lld & %llu

Submit Status uDebug

Description

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 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 (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 Nzeroes; 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 exactformat.

Sample Input

41 3 5 51 1 2 34 3 3 56 5 5 16 1 3 51 3 5 50 0 0 0101 2 2 2 4 5 6 6 6 91 2 3 4 5 6 7 8 9 11 1 2 2 3 3 4 4 5 51 2 1 3 1 5 1 6 1 91 2 2 5 5 5 6 6 6 70 0 0 0 0 0 0 0 0 00

Sample Output

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

  

猜数字游戏，统计有多少数字位置正确（A），有多少数字在两个序列都出现过但位置不对（B）。

[cpp] view plain copy

1. #include<stdio.h>  
2. #include<string.h>  
3. #define maxn 1010  
4. int main()  
5. {  
6. int n,i,j,A,B,a[maxn],b[maxn],c[maxn];  
7. int kase=0;  
8. while(scanf("%d",&n)!=EOF)  
9.     {  
10.         if(n==0) break;  
11.         printf("Game %d:\n",++kase);  
12.         for(i=1;i<=n;i++)  
13.         scanf("%d",&a[i]);  
14.       for(i=1;i<=n;i++)//后续操作中会更改A数组的值，所以使用C数组记录A数组中的内容  
15.             c[i]=a[i];  
16.         while(1)  
17.         {  
18.             A=0;  
19.             B=0;  
20.               for(i=1;i<=n;i++)  
21.        scanf("%d",&b[i]);  
22.        if(b[1]==0) break;  
23.         for(i=1;i<=n;i++)  
24.         if(a[i]==b[i]) {A++; a[i]=0;b[i]=-1;}//如果猜对了，将A、B数组中对应的数标记。  
25.         for(i=1;i<=n;i++)  
26.         {  
27.          if(b[i]!=-1)//如果该数没有猜对  
28.         {for(j=1;j<=n;j++)  
29.         if(a[j]==b[i]){B++; a[j]=0; break; }//一旦比较成功，将A数组中对应的数字退出比较的范围  
30.         }  
31.         }  
32.         printf("    (%d,%d)\n",A,B);  
33.          for(i=1;i<=n;i++)  
34.             a[i]=c[i];  
35.          }  
36.      }  
37. return 0;  
38. }