uvaoj-340:猜数字游戏的提示
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 lengthN 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 calledstrong wheni =j, and is calledweak otherwise. Two matches (i,j) and (p,q) are calledindependent wheni =p if and only ifj =q. A set of matches is calledindependent when all of its members are pairwise independent.
Designer chooses an independent setM 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 inM. 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 specifyingN (the length of the code). Following these will be the secret code, represented asN integers, which we will limit to the range 1 to 9. There will then follow an arbitrary number of guesses, each also represented asN integers, each in the range 1 to 9. Following the last guess in each game will beN 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 forN. The last game in the input will be followed by a single zero (when a value forN would normally be specified). The maximum value forN 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 theexact 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
给定一个密码串，输入待匹配串，如果相同位置字符相同得到一个A，不同位置的字符相同得到一个B，字符只能匹配一次并且A的优先级大于B就是先算A的然后再B。
Game 1:
(1,1)
(2,0)
(1,2)
(1,2)
(4,0)
Game 2:
(2,4)
(3,2)
(5,0)
(7,0)
题解：蛮水的一道题，技巧在于判断出现的数字总数那块，笔者最开始傻乎乎的sort排序比较来着，看来过年喝多了留下后遗症了，Orz。。。
code：
#include
#include
using namespace std;
{
int n;
int list[1010];
int colist[1010];
int ans[1010];
int time=0;//游戏次数累加器；
while(cin>>n&&n)
{
for(int i=0; i
cin>>list[i];
}
printf("Game %d:\n",++time);
while(1)
{
int num=0;
int sum=0;
for(int i=0; i
cin>>ans[i];
if(ans[i]==list[i])//位置和数字都相同的累加；
num++;
}
if(ans[0]==0) break;//正常序列里不可能有0，所以判定数组第一个数就行了；
int c1,c2;
{
c1=c2=0;
for(int j=0; j
if(i==list[j]) c1++;
if(i==ans[j]) c2++;
}
sum+=min(c1,c2);
}
printf(" (%d,%d)\n",num,sum-num);
}
}
return 0;
}