UVA 489 - Hangman Judge

Hangman Judge
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:

The contestant tries to solve to puzzle by guessing one letter at a time.
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.''
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    
   | /|\   
   |  |    
   | / \   
 __|_      
 |   |______
 |_________|If the drawing of the hangman is completed before the contestant has successfully guessed all the characters of the word, the contestant loses.
If the contestant has guessed all the characters of the word before the drawing is complete, the contestant wins the game.
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.题意：每组数据先输入一个n，代表第几组数据，第二行是一个要猜的字符串，第三行是你猜的字符串，如果猜对了一个字母，就说你把第一个字符串中所有与你猜对的相同的字母都猜对了。如果第一个字符串中的字母全被猜对了，输出you win.如果猜错的次数达到7次，输出You  lose. 否则输出You chickened  out.

#include<stdio.h>
#include<string.h>
int stroke;
int s[105]; /*记录第一行字符串中的字母是否猜过*/
int JudgeCorrect(char *a,char *b)
{
	int cnt,i,j,flag;
    stroke=0; /*猜错的次数*/
	cnt=0; /*猜对的次数*/
	memset(s,0,sizeof(s));
	for(i=0;i<strlen(b);i++)
	{
		flag=0;
		if(stroke==7) 
			break;
		for(j=0;j<strlen(a);j++)
		{
			if(b[i]==a[j]&&!s[j])
			{
				s[j]=1;
				cnt++;
				flag=1;
			}
		}
		if(!flag)
			stroke++;
	}
	return cnt;
}
int main()
{
	int i,j,cases,count,flag;
	char guess[105],answer[105];
	while(~scanf("%d",&cases)&&cases!=-1)
	{
		getchar();
		gets(answer);
		gets(guess);
		count=JudgeCorrect(answer,guess);
		printf("Round %d\n",cases);
		if(count==strlen(answer))  /*全猜对了*/
			printf("You win.\n");
		else if(stroke==7) /*猜错的次数达到7次*/
			printf("You lose.\n");
		else
			printf("You chickened out.\n");
	}
	return 0;
}

补充：软件开发 , C++ ,

上一个：Trie树及其应用
下一个：S3C2440 裸机时钟RTC