uva oj 340 - Master-Mind Hints

原创 2015年11月18日 21:37:03

Master-Mind Hints

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 tex2html_wrap_inline35 and a guess tex2html_wrap_inline37 , and are to determine the hint. A hint consists of a pair of numbers determined as follows.

match is a pair (i,j), tex2html_wrap_inline41 and tex2html_wrap_inline43 , such that tex2html_wrap_inline45 . 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

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)

第一行给定数组长度,接下来的第一行输入  仅含1~9  标准序列,之后的是猜测序列,与彩票/双色球类似,统计有多少数字正确 A ,有多少数字在两个序列中都出现过但位置不对 B,输入全是0时结束输入。

分析:直接统计可求得A,为了求B,对每个数字,统计二者出现的次数c1  c2,则min(c1,c2)就是该数字对B的贡献,最后要减去A的部分,代码如下;

#include<stdio.h>
const int mx = 1010;
int n, a[mx], b[mx];
int main(){
	int ca = 1;
	while(scanf("%d", &n)==1, n){
		printf("Game %d:\n", ca++);
		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 j = 1; j <= 9; j++)
			{
				int c1 = 0, c2 = 0;
				for(int i = 0 ; i < n; i++)
				{
					if(a[i]==j) c1++;
					if(b[i]==j) c2++;
				}
				if(c1 < c2)	B+=c1;
				else  B+=c2;
			}
			printf("    (%d,%d)\n", A, B-A);
		}
	}
	return 0;
} 



版权声明:转载请注明出处:http://blog.csdn.net/liu6886

UVA 340 Master-Mind Hints 猜数字提示的游戏 简单模拟

题意:以前曾经玩过的一个游戏,就是猜数字,原来的游戏规则是这样的: 請寫一個猜數字遊戲,電腦會產生一個四位數且每個數字都不重複的數字讓使用 者去猜,使用者猜測一組數字後,電腦會顯示 ?A?B 的訊息,...
  • hcbbt
  • hcbbt
  • 2013年08月23日 23:47
  • 2256

UVA - 1619 Feel Good(高效算法:滑动窗口)

题意大致是从一个数列里找一个最短的子序列,使得这个子序列的最小值乘这个子序列的和最大。 这道题最关键的地方是找到数列中的某个数在哪个连续序列里是最小的,即这个数的统治区域,一开始我想到的就是输入完之后...
  • qazwer1098
  • qazwer1098
  • 2015年05月03日 17:40
  • 3476

[华为机试练习题]17.可怕的阶乘

题目题目标题:计算阶乘n!是一件可怕的事情,因为当n并不是很大时,n!将是一个很大的值。例如13! = 6227020800,已经超过了我们常用的unsigned int类型的取值范围。请设计一个程序...
  • SunnyYoona
  • SunnyYoona
  • 2015年06月30日 11:50
  • 2832

《算法竞赛入门经典2ndEdition》 例题3-4 猜数字游戏的提示(Master-Mind Hints, Uva340)

看了好久还是没看懂题,看了这位大哥(http://www.cppblog.com/rakerichard/archive/2011/04/09/143775.html)翻译的再去看了下题才理解了题意,...
  • OccupiedCSDN
  • OccupiedCSDN
  • 2015年11月27日 18:58
  • 741

UVa 340 - Master-Mind Hints

Master-Mind Hints  MasterMind is a game for two players. One of them, Designer, selects a...
  • ACM2272902662
  • ACM2272902662
  • 2012年05月31日 21:57
  • 642

uva 340 -----Master-Mind Hints(猜数字游戏的提示)

MasterMind is a game for two players. One of them, Designer, selects a secret code. The other, Break...
  • lzn_317
  • lzn_317
  • 2017年04月05日 18:55
  • 81

UVa 340 Master-Mind Hints(猜数字游戏的提示)

题意  猜数字游戏  统计猜的数字有多少个数字位置正确  有多少个数字在答案中出现但是位置不正确  每个字符只能匹配一次 直接匹配每位数 #include #inclu...
  • acvay
  • acvay
  • 2014年08月31日 09:20
  • 903

章三例题4——UVA 340 Master -Mind Hints

Master-Mind Hints MasterMind is a game for two players. One of them, Designer, selects a secret cod...
  • bllsll
  • bllsll
  • 2017年02月27日 00:05
  • 119

uva340 - Master-Mind Hints

MasterMind is a game for two players. One of them, Designer, selects a secret code. The other,Breake...
  • Frankiller
  • Frankiller
  • 2012年06月09日 10:18
  • 1764

uva - 340 - Master-Mind Hints

//#define Local #include #include #include using namespace std; #define MAX 2000+10 struct Arr...
  • u013545222
  • u013545222
  • 2014年02月02日 22:12
  • 461
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:uva oj 340 - Master-Mind Hints
举报原因:
原因补充:

(最多只允许输入30个字)