UVA - 489 Hangman Judge
来源:互联网 发布:缓存数据库 编辑:程序博客网 时间:2024/05/18 00:19
Description
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
1cheesechese2cheeseabcdefg3cheeseabcdefgij-1
Sample Output
Round 1You win.Round 2You chickened out.Round 3You lose.
代码写的真好,看注释
#include<iostream>#include<cstring>using namespace std;int rest, chance; //还要猜rest个位置,错chance次后就输了。char s_ans[100], s_ges[100]; //答案和猜的字母序列。int win, lose; //win或lose等于1时得到结果。void guess(char ch){int bad = 1; //bad记录是否为对的字母。 int len = strlen(s_ans);for (int i = 0; i < len; i++) {if (s_ans[i] == ch) //猜对,该字母所有的位置都使得rest减1,并置为空格。再猜一次该字母为猜错。{rest--;bad = 0;s_ans[i] = ' ';}}if (bad) chance--; //猜错chance减1。if (!rest) win = 1;if (!chance) lose = 1;}int main(){int r = 0;while (cin >> r&&r != -1){win = lose = 0; //一定要初始化。cin >> s_ans;cin >> s_ges;chance = 7; rest = strlen(s_ans);int len = strlen(s_ges);for (int i = 0; i < len; i++) //遍历猜测序列的每个字母。得到结果就退出。{guess(s_ges[i]);if (win || lose) break;}cout << "Round " << r << endl;if (win) cout << "You win." << endl;else if (lose) cout << "You lose." << endl;else cout << "You chickened out." << endl;}}
- uva-489 - Hangman Judge
- Uva 489: Hangman Judge
- UVa 489 - Hangman Judge
- UVA 489 - Hangman Judge
- UVA 489 - Hangman Judge
- UVA 489 - Hangman Judge
- uva 489 Hangman Judge
- UVa 489 - Hangman Judge
- UVA - 489 - Hangman Judge
- UVA 489 Hangman Judge
- UVA - 489 Hangman Judge
- UVa 489 - Hangman Judge
- Uva 489 - Hangman Judge
- UVa-489 - Hangman Judge
- UVA - 489 Hangman Judge
- Uva - 489 - Hangman Judge
- UVA - 489 Hangman Judge
- UVA - 489 - Hangman Judge
- golang simplejson 使用笔记
- 节薇蚃袈芈蚆羅袁莃蒂袅膆
- 莈薀袄膃薃衿袃芅莆螅袂莇
- 蚀螇羂莁莆蚆羄肄薅袈袇肀
- 螈虿羈荿蚄虿肁膂薀蚈膃莇
- UVA - 489 Hangman Judge
- 螅莃莀螈羇芅莅蒄袇芈蒁蚃
- 袃膂薃袈袂芅螈螄袂莇薁蚀
- 薃羃羈膈蒆罿膇蒀葿肄芆荿
- 膁膈蒄袁袀莄莀蒇羃膇芆薇
- 蚇蚂袂膀芀袁螁膃莆薇肃肅
- 肅蒁袈袇莁莇袇羀膄蚅袆肂
- 肃芃薁蚁袀膂薄螇羈肂蒆袃
- 膅薂薁肅肁薁蚃袈荿薀螆肃