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".

样例输入

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

样例输出

Stan is dishonest
Stan may be honest

题意：

斯坦和奥利在玩猜谜游戏。斯坦想到了1到10之间的数字，奥利猜测这个数字可能是什么。在每次猜测之后，斯坦都指出奥利的猜测是太高、太低还是正确。

打了几回合后，奥利怀疑斯坦作弊，也就是说，他在奥利的猜测之间改变了数字。为了准备他对斯坦的案子，奥利录下了一些比赛的录音。你要确定每份成绩单是否都能证明斯坦在作弊。

标准输入由几份成绩单组成。每份成绩单都有一些配对的猜测和反应。a猜是包含1与10之间的单整数的行，而一个响应则是包含“过高”、“过低”或“正确”的行。每个游戏都以“正确”结尾。在最后的成绩单后面有一行包含0。

对于每个游戏，如果斯坦的反应与最后的猜测和反应不一致，那么输出一行“斯坦是不诚实的”。否则，打印“斯坦可能是诚实的”。

#include<iostream>
#include<cstring>
using namespace std;
 
int main()
{
	int a;
	char ans[10];
	while(1)
	{
		int Max  = 100;
		int Min  = 0;
		cin>>a;
		if(a == 0)
			break;
		getchar();   
		gets(ans);
		
		while(1)
		{
			
			if(strcmp(ans,"right on") == 0)
				break;
			if(strcmp(ans,"too high") == 0&&a<Max)
				Max = a;
 
			if(strcmp(ans,"too low") == 0&&a>Min)
				Min = a;
			cin>>a;
			getchar();   
			gets(ans);
		}
		
		if( a > Min && a < Max )
			
			printf("Stan may be honest\n");
		else
			printf("Stan is dishonest\n");
	}
	return 0;
}