Master-Mind Hints
来源:互联网 发布:琅琊榜 数据 编辑:程序博客网 时间:2024/06/04 00:26
#include <stdio.h>
#include <string.h>
int main()
{
int sect[1010];
int game[1010];
int n;
int num[15];
int num1[15];
int xt[15];
int bxt[15];
int countGame=0;
while(1)
{
scanf("%d",&n);
if(n==0)
break;
int countZero=0;
memset(sect,0,sizeof(sect));
memset(num1,0,sizeof(num1));
for(int i = 0;i<n;i++)
{
scanf("%d",§[i]);
num1[sect[i]]++;
}
countGame++;
printf("Game %d:\n",countGame);
while(countZero!=n)
{
memset(game,0,sizeof(game));
memset(num,0,sizeof(num));
memset(xt,0,sizeof(xt));
memset(bxt,0,sizeof(bxt));
for(int i = 0;i<n;i++)
{
int d;
scanf("%d",&game[i]);
if(game[i]!=0)
{
countZero=0;
num[game[i]]++;
}
else
countZero++;
if(countZero==n)
break;
}
for(int i = 0;i<n;i++)
{
//printf("%d %d\n",game[i],sect[i]);
if(game[i]==sect[i])
{
xt[game[i]]++;
}
}
for(int i = 1;i<=9;i++)
{
//printf("xt[%d] = %d\n",i,xt[i]);
bxt[i] = (num[i]>num1[i]?num1[i]:num[i]) - xt[i];
}
// for(int i =1;i<=n;i++)
// {
// bxt[i]+= num[i]>num1[i]?num1[i]:num[i];
// }
int a=0,c=0;
for(int i =1;i<=9;i++)
{
a+=xt[i];
c+=bxt[i];
}
if(countZero!=n)
printf(" (%d,%d)\n",a,c);
}
}
}
#include <string.h>
int main()
{
int sect[1010];
int game[1010];
int n;
int num[15];
int num1[15];
int xt[15];
int bxt[15];
int countGame=0;
while(1)
{
scanf("%d",&n);
if(n==0)
break;
int countZero=0;
memset(sect,0,sizeof(sect));
memset(num1,0,sizeof(num1));
for(int i = 0;i<n;i++)
{
scanf("%d",§[i]);
num1[sect[i]]++;
}
countGame++;
printf("Game %d:\n",countGame);
while(countZero!=n)
{
memset(game,0,sizeof(game));
memset(num,0,sizeof(num));
memset(xt,0,sizeof(xt));
memset(bxt,0,sizeof(bxt));
for(int i = 0;i<n;i++)
{
int d;
scanf("%d",&game[i]);
if(game[i]!=0)
{
countZero=0;
num[game[i]]++;
}
else
countZero++;
if(countZero==n)
break;
}
for(int i = 0;i<n;i++)
{
//printf("%d %d\n",game[i],sect[i]);
if(game[i]==sect[i])
{
xt[game[i]]++;
}
}
for(int i = 1;i<=9;i++)
{
//printf("xt[%d] = %d\n",i,xt[i]);
bxt[i] = (num[i]>num1[i]?num1[i]:num[i]) - xt[i];
}
// for(int i =1;i<=n;i++)
// {
// bxt[i]+= num[i]>num1[i]?num1[i]:num[i];
// }
int a=0,c=0;
for(int i =1;i<=9;i++)
{
a+=xt[i];
c+=bxt[i];
}
if(countZero!=n)
printf(" (%d,%d)\n",a,c);
}
}
}
阅读全文
0 0
- 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
- MOB第三方短信验证码
- 漫谈算法(番外篇) 符号标记以及基本数学公式
- Redis持久化
- 一台机器部署多个Tomcat项目
- hellodriver_第一课
- Master-Mind Hints
- 机试练习7.11
- -ms-,-moz-,-webkit-
- Office使用经验——一键移除文章中的多余空行(分享VBA源码)
- 用nodejs创建一个https服务器
- Django+Apache+mod_wsgi阿里云环境搭建(一)
- C++的三种访问权限与三种继承方式
- 关于matcapShader的研究
- android基础知识---用ActivityLifecycleCallbacks实现后台回来展示广告