UVa 489 Hangman Judge (模拟&字符串匹配)
来源:互联网 发布:大数据云计算人工智能 编辑:程序博客网 时间:2024/05/01 04:40
489 - Hangman Judge
Time limit: 3.000 seconds
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=94&page=show_problem&problem=430
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.
完整代码:
/*0.075s*/#include <cstdio>#include <cstring>bool x[27], y[27];char a[30], b[30];int main(void){int n;int t, k, i, lena, lenb;while (true){scanf("%d", &n);if (n < 0)break;t = k = 0;memset(x, 0, sizeof(x));memset(y, 0, sizeof(y));scanf("%s%s", a, b);lena = strlen(a), lenb = strlen(b);for (i = 0; i < lena; i++)x[a[i] & 31] = y[a[i] & 31] = true;for (i = 1; i < 27; i++)t += x[i];///至少要猜对t次for (i = 0; i < lenb; i++){if (x[b[i] & 31] && y[b[i] & 31]) ///猜对{y[b[i] & 31] = false;///再猜同样的字母就无效了t--;if (t == 0)break;}else if (!x[b[i] & 31]) ///猜错{k++;if (k == 7)break;}}printf("Round %d\n", n);if (t == 0)puts("You win.");else if (k == 7)puts("You lose.");elseputs("You chickened out.");}return 0;}
- UVa 489 Hangman Judge (模拟&字符串匹配)
- UVa 489 Hangman Judge [模拟]
- UVa 489 Hangman Judge(字符串)
- UVa 489 Hangman Judge(字符串)
- UVa 489 - Hangman Judge【字符串...】
- UVA oj 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
- &&逻辑运算符的汇编代码
- 为sourceinsight添加makefile和configure文件
- 关于之前自己写的菜票软件。。。
- 好的JFreechart学习网站
- HDU 1394 Minimum Inversion Number
- UVa 489 Hangman Judge (模拟&字符串匹配)
- 将整数n分成k份
- Andrioid自带pull解析xml顺序截图
- 为什么看不到我的账户用了几年呢? 哈哈~
- POJ 2159任意符合的密文
- 自定义标签(TagSupport )
- 百度地图之云检索功能
- hdu 1799 循环多少次? 动态规划
- Study FlexBuilder《4.6版本及SDK下载》