Guessing Game

本文介绍了一个简单的猜数字游戏作弊检测算法。通过记录玩家猜测数字的过程及反馈,判断被猜者是否存在作弊行为。利用数组记录有效数字范围,结合输入输出流程实现逻辑验证。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Guessing Game



Stan and Ollie are playing a guessing game. Stan thinks of a number between 1 and 10 and Ollie guesses what the number might be. After each guess, Stan indicates whether Ollie's guess is too high, too low, or right on.

After playing several rounds, Ollie has become suspicious that Stan cheats; that is, that he changes the number between Ollie's guesses. To prepare his case against Stan, Ollie has recorded a transcript of several games. You are to determine whether or not each transcript proves that Stan is cheating.

Standard input consists of several transcripts. Each transcript consists of a number of paired guesses and responses. A guess is a line containing single integer between 1 and 10, and a response is a line containing "too high", "too low", or "right on". Each game ends with "right on". A line containing 0 follows the last transcript.

For each game, output a line "Stan is dishonest" if Stan's responses are inconsistent with the final guess and response. Otherwise, print "Stan may be honest".

Sample Input

10
too high
3
too low
4
too high
2
right on
5
too low
7
too high
6
right on
0

Sample Output

Stan is dishonest
Stan may be honest

解析:题意是猜数字游戏。开始Stan 想一个1到10的数a。然后Ollie 去猜,如果大于a则Stan 说too high,小于则说too low。如果相等则说right on。但是Stan会说谎,所以通过stan的回答来判断是否Stan说谎。

思路:用一个1到10的数组,来标记还在范围内的数。例如说一个数n,如果给的是too high,则大于等于n的数都可以标记不合法了。

当出现right on时,看数组中是否还有数。如果还有就可以判断Stan可能没说谎。

#include"stdio.h"
#include"string.h"
int main()
{
int n,x,y,i,j,k;
char s[20];
int a[11];
while(scanf("%d",&n)!=EOF&&n)
{


memset(a,0,sizeof(a));
while(gets(s)&&strcmp(s,"right on"))
{  
   if(!strcmp(s,"too high"))
{
  for(i=n;i<=10;i++)
   a[i]=1;
}
if(!strcmp(s,"too low"))
{
for(i=n;i>=1;i--)
 a[i]=1;
}
scanf("%d",&n);
}
if(a[n]==0)
printf("Stan may be honest\n");
else
printf("Stan is dishonest\n");
}
return 0;
}




评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值