UVA 489-Hangman Judge
来源:互联网 发布:防御矩阵中文破解版 编辑:程序博客网 时间:2024/06/09 17:35
猜单词游戏每次猜1个字母猜错的次数不能大于7 另外猜一个已经猜过的字母也算错
<pre name="code" class="cpp">#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#define Maxn 105char s1[Maxn],s2[Maxn];typedef long long ll;using namespace std;int win,lose;int remaining,chance;void guess(char c){ int bad=1; for(int i=0;i<strlen(s1);i++) if(s1[i]==c) { remaining--; s1[i]=' '; bad=0; } if(bad) --chance; if(!chance) lose=1; if(!remaining) win=1;}int main(){ int n; while(~scanf("%d%s%s",&n,s1,s2)&&n!=-1) { printf("Round %d\n",n); win=lose=0; remaining=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;}
0 0
- 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
- HDU 5304(Eastest Magical Day Seep Group's Summer-环加外向树生成树计数)[Template:Kirchhoff矩阵]
- iOS - 中三种定时器的用法NSTimer、CADisplayLink、GCD
- Activity
- 2015/8/19/横、竖、满屏/消除标题、标题栏/startActivityForResult(启动带有返回值的intent)/Intent
- Python学习笔记二:Python中的列表
- UVA 489-Hangman Judge
- 欢迎访问我在博客园的博客
- UI16_数据持久化(NSUserDefaults,简单对象,复杂对象归档反归档,文件管理者"删除添加文件")
- 题目:矩阵的之字型遍历
- 多线程并发问题(二)
- HDU 1203 I NEED A OFFER!
- 八大排序算法总结
- Spring Hibernate 开启事务
- 题目:空格替换