Hangman Judge(自顶而下的程序设计方法)(UVa 489)
来源:互联网 发布:角球数据查询 编辑:程序博客网 时间:2024/06/15 08:36
Hangman Judge
64-bit integer IO format: %lld Java class name: Main
[PDF Link]
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
1cheesechese2cheeseabcdefg3cheeseabcdefgij-1
Sample Output
Round 1You win.Round 2You chickened out.Round 3You lose.
代码分析:将程序一个部分分出去变成一个函数guess(),这样增加了程序的可读性
#include<stdio.h>#include<string.h>#define MAXN 105int left, chance;//left为剩余剩下未猜到的字母数量,chance为你还剩下错误的机会 char s1[MAXN], s2[MAXN];int win, lose;void guess(char ch){int find =0;//判断是否在s1中找到ch字母 for(int i=0; i<strlen(s1); i++){if(ch == s1[i]){s1[i] = ' ';//s1中抹去ch字母,避免重复判断find = 1; left--;}}if(!find) chance--;if(left == 0) win = 1;else if(chance == 0) lose = 1;return ;} int main(){int rnd;while((scanf("%d", &rnd) == 1)&&(rnd != -1)){scanf("%s %s", s1, s2); win = 0, lose = 0;printf("Round %d\n", rnd);left = strlen(s1);chance = 7;for(int i=0; i<strlen(s2); i++){guess(s2[i]);if(win || lose) break;}if(win) printf("You win.\n");else if(lose) printf("You lose.\n");else printf("You chickened out.\n");}return 0;}
- Hangman Judge(自顶而下的程序设计方法)(UVa 489)
- Hangman Judge (UVA-489)
- 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
- java-字符串查找
- 【Hibernate】多对一映射
- 一个梯度下降算法的例子
- Linux切换用户
- 谈谈我对Android View事件分发的理解
- Hangman Judge(自顶而下的程序设计方法)(UVa 489)
- Java:List和Array相互转换
- 最大间隙问题
- spring mvc上传文件的三种方式
- lua 一些简单的库函数
- 面试自动化测试的必问题
- Android Jenkins+git+gradle
- ARM指令集详解
- 一起来搞机4:利用Kcptun为SS加速