Master-Mind Hints UVa340 排序&&查找
来源:互联网 发布:mac最大化窗口的快捷键 编辑:程序博客网 时间:2024/04/29 19:44
Root :: Problem Set Volumes :: Volume III
340 - Master-Mind Hints
340 - Master-Mind Hints
先排序比较,然后再按原顺序比较。weak=总共相同的数 - strong.
水题一道。
#include <iostream>#include <cstdio>#include <cstdlib>#include <algorithm>#include <string.h>using namespace std;#define N 1005int secret[N],guess[N],s_t[N],g_t[N];int main(){#ifndef ONLINE_JUDGEfreopen("340in.txt","r",stdin);#endifint n,i,j,sum,ce=0,total,strong;while (scanf("%d",&n)!=EOF&&n){ce++;for (i=0;i<n;i++){scanf("%d",&secret[i]);s_t[i]=secret[i];}sort(s_t,s_t+n);printf("Game %d:\n",ce);while (true){sum=0;for (i=0;i<n;i++){scanf("%d",&guess[i]);sum+=guess[i];g_t[i]=guess[i];}if (!sum)break;sort(g_t,g_t+n);total=0;for (i=0,j=0;i<n&&j<n;){if (s_t[i]==g_t[j]){i++;j++;total++;}else if (s_t[i]<g_t[j])i++;else j++;}strong=0;for (i=0,j=0;i<n&&j<n;i++,j++){if (secret[i]==guess[j])strong++;}printf(" (%d,%d)\n",strong,total-strong);}}return 0;}
- Master-Mind Hints UVa340 排序&&查找
- 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
- UVa340——Master-Mind Hints
- 排序/查找 340 - Master-Mind Hints
- 排序检索A - Master-Mind Hints
- 排序检索-340 Master-Mind Hints
- 340 - Master-Mind Hints
- Windows7下eclipse字体太小的问题解决
- Linux中运行silverlight 的方法
- centos5.5下实现asterisk1.8_*+RSTP安装及配置过程
- //设置开机启动项
- UML总结—状态图(State Diagram)
- Master-Mind Hints UVa340 排序&&查找
- c# 文件及目录操作类
- Android锁屏后调用了ondestroy()方法,解屏后重新oncreate()的问题的解决方案。
- 基于openswan klips的IPsec VPN实现分析(九)加密算法维护
- 基于ALSA的WAV播放和录音程序
- 由遍历序列构造二叉树
- 我犯过的错误-代码易错点
- A/B测试全面指南
- vs2012更改默认开发环境