UVa 489 Hangman Judge (模拟&字符串匹配)

本文介绍了一个用于判断Hangman文字游戏胜负的程序实现方案。该程序可以接收一系列游戏输入,包括谜底单词和玩家的猜测,并据此判断玩家是否获胜、失败或是放弃游戏。

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

489 - Hangman Judge

Time limit: 3.000 seconds

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=94&page=show_problem&problem=430

In ``Hangman Judge,'' you are to write a program that judges a series of Hangman games. For each game, the answer to the puzzle is given as well as the guesses. Rules are the same as the classic game of hangman, and are given as follows:

  1. The contestant tries to solve to puzzle by guessing one letter at a time.
  2. Every time a guess is correct, all the characters in the word that match the guess will be ``turned over.'' For example, if your guess is ``o'' and the word is ``book'', then both ``o''s in the solution will be counted as ``solved.''
  3. Every time a wrong guess is made, a stroke will be added to the drawing of a hangman, which needs 7 strokes to complete. Each unique wrong guess only counts against the contestant once.

       ______   
       |  |     
       |  O     
       | /|\    
       |  |     
       | / \    
     __|_       
     |   |______
     |_________|
  4. If the drawing of the hangman is completed before the contestant has successfully guessed all the characters of the word, the contestant loses.
  5. If the contestant has guessed all the characters of the word before the drawing is complete, the contestant wins the game.
  6. If the contestant does not guess enough letters to either win or lose, the contestant chickens out.

Your task as the ``Hangman Judge'' is to determine, for each game, whether the contestant wins, loses, or fails to finish a game.

Input

Your program will be given a series of inputs regarding the status of a game. All input will be in lower case. The first line of each section will contain a number to indicate which round of the game is being played; the next line will be the solution to the puzzle; the last line is a sequence of the guesses made by the contestant. A round number of -1 would indicate the end of all games (and input).

Output

The output of your program is to indicate which round of the game the contestant is currently playing as well as the result of the game. There are three possible results:

You win.
You lose.
You chickened out.

Sample Input

1
cheese
chese
2
cheese
abcdefg
3
cheese
abcdefgij
-1

Sample Output

Round 1
You win.
Round 2
You chickened out.
Round 3
You lose.

完整代码:

/*0.075s*/

#include <cstdio>
#include <cstring>

bool x[27], y[27];
char a[30], b[30];

int main(void)
{
	int n;
	int t, k, i, lena, lenb;
	while (true)
	{
		scanf("%d", &n);
		if (n < 0)
			break;
		t = k = 0;
		memset(x, 0, sizeof(x));
		memset(y, 0, sizeof(y));
		scanf("%s%s", a, b);
		lena = strlen(a), lenb = strlen(b);
		for (i = 0; i < lena; i++)
			x[a[i] & 31] = y[a[i] & 31] = true;
		for (i = 1; i < 27; i++)
			t += x[i];///至少要猜对t次
		for (i = 0; i < lenb; i++)
		{
			if (x[b[i] & 31] && y[b[i] & 31]) ///猜对
			{
				y[b[i] & 31] = false;///再猜同样的字母就无效了
				t--;
				if (t == 0)
					break;
			}
			else if (!x[b[i] & 31]) ///猜错
			{
				k++;
				if (k == 7)
					break;
			}
		}
		printf("Round %d\n", n);
		if (t == 0)
			puts("You win.");
		else if (k == 7)
			puts("You lose.");
		else
			puts("You chickened out.");
	}
	return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值