Master-Mind Hints
来源:互联网 发布:2015网络彩票开售 编辑:程序博客网 时间:2024/05/16 10:55
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 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)
#include<iostream>using namespace std;main(){ int n; int a[1000],b[1000]; static int count=0; while(cin>>n) { cout<<"Game "<<++count<<":"<<endl; for(int i=0;i<n;i++) cin>>a[i]; int c,d; bool cf[1000],de[1000];//利用布尔类型,审查数组下标! while(1) { c=0; d=0; for(int j=0;j<n;j++) cin>>b[j]; if(b[0]==0) break; memset(cf, true, sizeof(cf));memset(de, true, sizeof(de)); for(int i=0;i<n;i++) if(b[i]==a[i]) { c++,cf[i]=false,de[i]=false;}//如果匹配成功就记为false,舍去!!! for(int f=0;f<n;f++) for(int t=0;t<n;t++) if(a[f]==b[t] && f!=t && cf[f] && de[t]) { d++,cf[f]=false,de[t]=false;} cout<<"("<<c<<","<<d<<")"<<endl; } }}
- uva340 - Master-Mind Hints
- 340 - Master-Mind Hints
- uva_340 - Master-Mind Hints
- uva_340 - Master-Mind Hints
- 340 - Master-Mind Hints
- UVa340 Master-Mind Hints
- 340 - Master-Mind Hints
- uva Master-Mind Hints
- Master-Mind Hints
- 340 - Master-Mind Hints
- UVA340 - Master-Mind Hints
- 340 - Master-Mind Hints
- UVA340 Master-Mind Hints
- Master-Mind Hints
- Master-Mind Hints
- uva340 - Master-Mind Hints
- Master-Mind Hints
- 340 - Master-Mind Hints
- oracle操作命令大全
- 数据结构与算法:哈夫曼树(源码)!
- 自定义显示圆形图片
- Minimum Depth of Binary Tree
- 编辑文章 - 博客频道 - CSDN.NET
- Master-Mind Hints
- Android NDK入门
- CoNLL Multi-lingual Dependency Parsing 格式
- mysql 源码编译安装
- 不错网站推荐不定期更新
- 180行ruby代码搞定游戏2048
- 嵌入Chrome cef之完整版(本教程基于cef1)
- sublime text3安装emmet,很简单实用
- 无法在web服务器上启动调试,web服务器配置不正确的解决办法