UVA489 - Hangman Judge
来源:互联网 发布:怎么卸载mac自带系统 编辑:程序博客网 时间:2024/05/01 15:57
问题描述
输入一个要猜测的答案字符串s,猜的字符串s2,判断猜测的字符错误次数为7次以内,7次以内并且全部猜中算赢,如果没猜中,则算放弃,如果错7次或以上则判定为输。
思路
进行比较字符时,将比较成功的字符改成空格,极大简化了步骤。
代码
紫书(《算法竞赛入门经典(第二版)》)中的代码简洁明了。
#include <iostream>#include <cstdio>#include <cstring>#define maxn 100using namespace std;int Left, chance; // 还需猜Left个位置,错chance次后就会输char s[maxn],s2[maxn]; // 答案是字符串s,玩家猜出的字母序列为s2int win,lose; // win=1为赢,lose=1为输void guess(char ch){ int bad=1; for(int i=0;i<strlen(s);i++) if(s[i]==ch){Left--;s[i]=' ';bad=0;} if(bad) chance--; if(!chance) lose=1; if(!Left) win=1;}//判断成功后,更改字符为空格然后重新进行判断int main(){ int rnd; while(cin>>rnd&&rnd!=-1) { scanf("%s%s",s,s2); printf("Round %d\n",rnd); win=lose=0; Left=strlen(s); 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;}
0 0
- uva489 Hangman Judge
- uva489-Hangman Judge
- UVa489 Hangman Judge
- Uva489 - Hangman Judge
- UVA489 Hangman Judge
- uva489 Hangman Judge (模拟)
- UVA489 - Hangman Judge
- UVA489-Hangman Judge
- uva489 - Hangman Judge
- UVa489 - Hangman Judge
- UVa489 Hangman Judge
- UVA489 Hangman Judge
- UVA489 - Hangman Judge
- UVa489 - Hangman Judge
- Hangman Judge uva489
- UVa489-Hangman Judge
- 水题:UVa489-Hangman Judge
- UVa489 Hangman Judge
- PAT Basic
- java小总结
- Python学习笔记(一)
- PAT Basic 1034 有理数四则运算(20)
- Ubuntu入门学习bash和shell(3)
- UVA489 - Hangman Judge
- CardLayout(卡片布局)
- Android okHttp总结篇一
- 如何在一台windows主机上实现MySQL的主从复制?
- 如何利用百度在线地图获取坐标
- Maximum Product of Word Lengths
- iOS开发 ☞ 五分钟集成环信,你逗我?
- java基础(三)
- 3.Chrome开发者工具不完全指南(二、进阶篇)