Hangman Judge UVA - 489

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.

1 #include<bits/stdc++.h> 2 #define maxn 105 3 using namespace std; 4 char s[maxn],h[maxn]; 5 int n,len,chance; 6 int win,lose; 7 void guess(char ch) 8 { 9 int bad=0; 10 for(int i=0;i<strlen(s);i++) 11 { 12 if(ch==s[i]) 13 { 14 bad=1; 15 len--;//判斷win 16 s[i]=' '; 17 } 18 } 19 if(!bad) 20 chance--; 21 if(!chance)lose=1; 22 if(!len)win=1; 23 } 24 int main() 25 { 26 while(scanf("%d%s%s",&n,s,h)==3,n!=-1) 27 { 28 printf("Round %d\n",n); 29 win=lose=0; 30 len=strlen(s); 31 chance=7; 32 for(int i=0;i<strlen(h);i++) 33 { 34 guess(h[i]); 35 if(lose||win)break; 36 } 37 if(lose)printf("You lose.\n"); 38 else if(win)printf("You win.\n"); 39 else printf("You chickened out.\n"); 40 } 41 return 0; 42 }

?

題意：
模擬一個猜詞游戲的裁判器。每次猜一個字母，如果猜對該字母會顯示出來，猜錯七次算輸，猜錯[0,6]次內把正確字母都猜出來算贏，如果未輸未贏情況下放棄猜測那么算放棄猜測。

注意點：

思路簡單，倒是有幾個注意點。

1.小人為七筆畫，0筆時錯0次，1筆時錯1次··· ···，7筆時輸了。一開始chance寫成6了，WA了。

2.巧妙的方法，利用len的大小來判斷是否win，當len==0說明所有的字母都猜測到了。被判斷過有的字母要置空，防止影響后面的判斷，每一次都要遍歷全部的長度，防止后面還有一樣的字母沒有置空。for(int i=0;i<strlen(s);i++)遍歷全部長度的時候，注意不要用len,而要用strlen(s) 因為,len的長度是不斷改變的。

?

轉載于:https://www.cnblogs.com/zuiaimiusi/p/10949711.html

總結

以上是生活随笔為你收集整理的Uva489的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。