489-Hangman Judge

Hangman Judge

In ''hangman judge, ''you are writing 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
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 in 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-1Wocould 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

1cheesechese2cheeseabcdefg3cheeseabcdefgij-1

Sample Output

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

I have been thinking about this topic for a long time and have never understood the final judgment condition. I have really written a good reprinted code from someone else.

Copy from click to open the link

#include <stdio.h>#include <string.h>#define MAX 104char answer[MAX];char guess[MAX];int alpha[MAX];int main(){    int a, i, j;    while (scanf("%d", &a) && a != -1)    {          getchar();          int flag, stroke = 0;          memset(alpha, 1, MAX);          gets(answer);          gets(guess);          printf("Round %d\n", a);          for (i = 0; i < strlen(guess); i++)          {              flag = 0;              if (alpha[guess[i] - 'a'])              {                  for (j = 0; j < strlen(answer); j++)                      if (guess[i] == answer[j])                      {                          answer[j] = '0';                          flag = 1;                      }                  alpha[guess[i] - 'a'] = 0;                  if (!flag)                        stroke++;              }                            if (stroke == 7)              {                 printf("You lose.\n");                 flag = 1;                 break;                       }                            flag = 1;              for (j = 0; j < strlen(answer); j++)               {                      if (answer[j] != '0')                      {                         flag = 0;                         break;                      }               }               if (flag)               {                  printf("You win.\n");                  break;               }          }          if (!flag)             printf("You chickened out.\n");    }    return 0;}