UVa 340 Master-Mind Hints
来源:互联网 发布:中国最大源码网站 编辑:程序博客网 时间:2024/05/29 10:12
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 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 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 exact format.
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,对于每个数字(1-9),统计二者出现的次数c1和c2。则两者中较小的一个就是该数字对B的贡献,最后减去A的部分即可。
#include<stdio.h>#define maxn 1010int main(void){//freopen("input.txt","r",stdin);int n, a[maxn], b[maxn];int kase = 0;while(scanf("%d", &n) == 1 && n) { //n=0时输入结束 printf("Game %d:\n", ++kase); for(int i = 0; i < n; i++) scanf("%d", &a[i]); for(;;) { 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 d = 1; d <= 9; d++) { int c1 = 0, c2 = 0;//统计数字d在答案序列和猜测序列中各出现多少次 for(int i = 0; i < n; i++){ if(a[i] == d) c1++; if(b[i] == d) c2++; } if(c1 < c2) B += c1;else B += c2; } printf(" (%d,%d)\n", A, B-A); }}return 0;}
- 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 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
- HDU2674 N!Again 【数学】
- poj 1308 并查集(判断一组点对是否能够组成树)
- HDU 1711 Number Sequence KMP题解
- 在eclipse下直接部署maven工程缺少jar包问题
- ios--视图控制器视图的装载
- UVa 340 Master-Mind Hints
- sort函数用法详解
- JavaScript学习二 常言的方法整理
- 包含最小元素的栈
- hdu 1754 I Hate It
- Ubuntu(Linux)常用的指令
- 常用颜色的RGB值及中英文名称
- Linux下TI omap芯片 MUX 配置分析(以AM335X芯片为例)
- Bupt summer training for 2013_String