Uva340-master-mind hints

Source: Internet
Author: User

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.

AMatchIs a pair (I,J), And
, Such that. Match (I,J) Is calledStrongWhen
I=J, And is calledWeakOtherwise. Two matches (I,J) And (P,Q) Are calledIndependentWhen
I=PIf and only ifJ=Q. A set of matches is called
IndependentWhen all of its members are pairwise independent.

Designer chooses an Independent SetMOf 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.


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, representedNIntegers, which we will limit to the range
1 to 9. There will then follow an arbitrary number of guesses, each also representedNIntegers, each in the range 1 to 9. Following the Last guess in each game will beNZeroes; 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 valueN. The last game in the input will be followed by a single zero (when a valueNWocould normally be specified). The maximum
ValueNWill be 1000.


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

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

Given a password string, enter the string to be matched. If the characters at the same position are the same, a A is obtained. If the characters at different positions are the same, B is obtained, the character can only be matched once and the priority of A is greater than that of B, that is, a is first calculated before B.

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


# Include <stdio. h>
Void main ()
{Int I, j, F, n, a, B, a [1010], B [1010], C [1010], sum = 0, num;
While (scanf ("% d", & N), n)
{++ Sum;
Printf ("game % d: \ n", sum );
For (I = 1; I <= N; I ++)
Scanf ("% d", & A [I]);
F = 1;
While (f)
{Num = 0;
For (I = 1; I <= N; I ++)
{Scanf ("% d", & B [I]); C [I] = A [I]; If (B [I] = 0) ++ num ;}
If (num = N) break;
A = 0; B = 0;
For (I = 1; I <= N; I ++)
If (C [I] = B [I]) {++ A; C [I] =-1; B [I] =-1 ;}
For (I = 1; I <= N; I ++)
If (C [I]! =-1)
For (j = 1; j <= N; j ++)
If (C [I] = B [J]) {++ B; C [I] =-1; B [J] =-1; break ;}
Printf ("(% d, % d) \ n", a, B );


Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.