zoukankan      html  css  js  c++  java
  • Uva

    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.
    不小心一直把代码提交给前一道题目,怎么都WA,差点奔溃,智商太拙计了

    AC代码:

    #include <iostream>
    #include <cstdio>
    #include <cstdlib>
    #include <cctype>
    #include <cstring>
    #include <algorithm>
    
    using namespace std;
    
    int  chance;
    char puzzle[100], guesses[200];
    int win, lose;
    int position;
    
    void guess(char ch) {
    	int bad = 1;
    	for (int i = 0; i < strlen(puzzle); i++) {
    		if (puzzle[i] == ch) {
    			position--;
    			puzzle[i] = ' ';
    			bad = 0;
    		}
    	}
    	if (bad) {
    		--chance;
    	}
    	if (!chance) {
    		lose = 1;
    	}
    	if (!position) {
    		win = 1;
    	}
    }
    
    int main()
    {
    	int number;
    	while (cin >> number) {
    		// -1退出
    		if (number == -1) {
    			break;
    		}
    		scanf("%s%s", puzzle, guesses);
    		win = lose = 0;
    		chance = 7;
    		position = strlen(puzzle);
    		for (int i = 0; i < strlen(guesses); i++) {
    			guess(guesses[i]);
    			if (win || lose) {
    				break;
    			}
    		}
    		cout << "Round " << number << endl;
    		if (win) {
    			cout << "You win.
    ";
    		}
    		else if (lose) {
    			cout << "You lose.
    ";
    		}
    		else {
    			cout << "You chickened out.
    ";
    		}
    	}
    
    	return 0;
    }






  • 相关阅读:
    工厂方法模式(2)
    单例模式(1)
    数组中任意位置添加数组
    六中设计模式中的原则总结
    开闭原则(设计模式6)
    迪米特法则(设计模式5)
    接口隔离原则(设计模式4)
    依赖倒置原则(设计模式3)
    里氏替换原则(设计模式原则2)
    相似图片搜索的原理(二) (转载)
  • 原文地址:https://www.cnblogs.com/zhangyaoqi/p/4591613.html
Copyright © 2011-2022 走看看