[UVA - 340] Master-Mind Hints
2017-10-10 23:56
369 查看
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
A match is a pair
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
Input
The input will consist of data for a number of games. The input for each game begins with an integer specifying
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
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
Sample Output
UVA-340,《算经》P50
难点主要在于:B怎么处理,为什么B-A得到错位的数据,为什么统计两者最小值?常常思考下。
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
s1 . . . snand 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 ≤ nand
1 ≤ j ≤ n, such that
si = gj. 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 = pif 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
Nintegers, which we will limit to the range
1to
9. There will then follow an arbitrary number of guesses, each also represented as
Nintegers, each in the range
1to
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 ‘0’ (when a value for
Nwould 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)
UVA-340,《算经》P50
#include <stdio.h> #include <string.h> #define MAX 1010 int main() { //freopen("test.txt", "r", stdin); int n, a[MAX], b[MAX]; int kcase = 1; while(scanf("%d", &n)==1 && n) { printf("Game %d:\n", kcase++); for(int i=0; i<n; ++i) scanf("%d", &a[i]); while(1) { int A=0, B=0; for(int i=0; i<n; ++i) { scanf("%d", &b[i]); if(a[i]==b[i]) ++A; } if(b[0]==0) break; //退出条件 for(int i=1; i<=9; ++i) { int c1=0,c2=0; for(int j=0; j<n; ++j) { if(a[j]==i) ++c1; if(b[j]==i) ++c2; } if(c1>c2) B+=c2; else B+=c1; } printf(" (%d,%d)\n", A, B-A); } } return 0; }
难点主要在于:B怎么处理,为什么B-A得到错位的数据,为什么统计两者最小值?常常思考下。
相关文章推荐
- UVA 340 - Master-Mind Hints
- UVa 340 - Master-Mind Hints
- UVa 340 - Master-Mind Hints
- UVA - 340 Master-Mind Hints
- UVa 340 - Master-Mind Hints
- uva_340 - Master-Mind Hints
- *UVa 340 Master-Mind Hints(例题3-4)
- 猜数字游戏的提示 (Master-Mind Hints, UVa 340)
- UVA340 Master-Mind Hints
- UVa 340 Master-Mind Hints
- UVA - 340 Master-Mind Hints
- UVA 340 Master-Mind Hints 猜数字提示的游戏 简单模拟
- UVA - 340 Master-Mind Hints
- uva 340 Master-Mind Hints(水题)
- UVA 340-Master-Mind Hints
- UVa-340 - Master-Mind Hints
- UVa:340 - Master-Mind Hints
- UVa 340 Master-Mind Hints
- UVa 340 Master-Mind Hints
- UVA 340 (暑假-排序、检索 -A - Master-Mind Hints)