UVA340 - Master-Mind Hints
来源:互联网 发布:女朋友生日礼物 知乎 编辑:程序博客网 时间:2024/04/27 10:29
问题描述
猜数字,先给定四个数,然后再输入四个数,如果数字和位置一致,则a++,如果数字正确,则为b++,结果输出(a,b)
思路
学习了map以后,发现可以将各种数据类型联系起来,先记录正确数值,在开始判断数值且位置相等,则A++,然后计算总共猜对了B个数后结果为(A,B-A)
代码
#include <cstdio>#include <iostream>#include <algorithm>#include <string>#include <stack>#include <vector>#include <map>using namespace std;int main(){ int a[1010],b[1010]; int n,i,t=1; int A,B; while(cin>>n&&n) { map<int,int> q; cout<<"Game "<<t++<<":\n"; for(i=0;i<n;i++) { cin>>a[i]; q[a[i]]++; //记录正确值 } while(1) { map<int,int>p; A=B=0; for(i=0;i<n;i++) { cin>>b[i]; p[b[i]]++; if(a[i]==b[i]) //如果位置和数值一致 A++; } if(b[0]==0) break; for(i=1;i<=9;i++) //计算1—9之间总共猜对了B个数 B+=min(p[i],q[i]); printf(" (%d,%d)\n",A,B-A); } } return 0;}
0 0
- uva340 - Master-Mind Hints
- UVa340 Master-Mind Hints
- UVA340 - Master-Mind Hints
- UVA340 Master-Mind Hints
- uva340 - Master-Mind Hints
- UVA340 - Master-Mind Hints
- UVa340 Master-Mind Hints
- uva340 Master-Mind Hints
- UVa340-Master-Mind Hints
- UVa340 Master-Mind Hints
- UVA340 UVALive5448 Master-Mind Hints
- Master-Mind Hints—UVa340
- Master-Mind Hints UVa340 排序&&查找
- UVa340——Master-Mind Hints
- 340 - Master-Mind Hints
- uva_340 - Master-Mind Hints
- uva_340 - Master-Mind Hints
- 340 - Master-Mind Hints
- Ubuntu下安装AS,太爽了!!!
- 动态规划问题系统---edit-distance
- 堆栈
- jquery点击获取table 中的元素内容
- [HDU 5881] Tea (贪心)
- UVA340 - Master-Mind Hints
- HDU 5881 乱搞
- Codeforces Round #372 (Div. 1) C. Digit Tree(树的点分治)
- 480.Binary Tree Paths-二叉树的所有路径(容易题)
- get c_function* from lua_State*
- rpm软件包
- linux php+gd库的源码安装
- 488.Happy Number-快乐数(容易题)
- Codeforces Round #372 (Div. 2) B. Complete the Word __ two pointers、队列(queue)