UVa-489 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:

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.

二.分析

题目要求猜字母,如果猜中某一个字母,则全部该字母都算猜中,如果猜错超过7次,则失败,未到错7次但未全部猜中则chickened out.

题目中只会给出小写的样例,所以只需要考虑小写字母的情况.

#include<stdio.h>
#include<string.h>
int judge(char *s1,char *s2)
{
	int falsetimes=0;//表示答错的次数
	int s1v[26],s2v[26];//定义s1v数组表示s1字符串中各个字母的存在情况
	memset(s1v,0,sizeof(s1v));//清空数组
	memset(s2v,0,sizeof(s2v));
	int n1=strlen(s1),n2=strlen(s2);
	int i;
	for(i=0;i<n1;i++)
	s1v[s1[i]-'a']++;//标记该字母在s1中存在
	int total=0;
	
	for(i=0;i<26;i++)
	if(s1v[i]>0) total++;//计算s1中不同字母的存在个数
	
	for(i=0;i<n2;i++)
	{
		if(s2v[s2[i]-'a']==0) 
		{
			if(s1v[s2[i]-'a']==0) //s2中存在该字母但s1中不存在,表示回答错误
		{
			falsetimes++;
			if(falsetimes>=7) return 1;
		}
		else {
			total--;//回答正确,字母total总数-1
			if(total==0) return 0;
		}
		}
		s2v[s2[i]-'a']=1;
	}
	return 2;//没有全对或全错,返回You chickened out.
}
int main()
{
	int n;
	while(scanf("%d",&n))
	{
		if(n==-1) break;
		printf("Round %d\n", n);
		char s1[2000],s2[2000];
		scanf("%s%s",s1,s2);
		char a[3][100]={"You win.","You lose.","You chickened out."};
		printf("%s\n",a[judge(s1,s2)]);
	}
}