UVA489 Hangman Judge
来源:互联网 发布:服务器入门书籍 知乎 编辑:程序博客网 时间:2024/05/11 22:53
问题链接:UVA489 Hangman Judge。
问题简述:(略),参见原题链接。
问题分析:这是一个模拟题。
程序说明:程序中定义了若干宏定义,使得程序可阅读性增强。函数guess()中的逻辑做了适当的改进,更加合理快速。
AC的C语言程序如下:
/* UVA489 Hangman Judge */#include <stdio.h>#include <string.h>#define TRUE 1#define FALSE 0#define MAXN 128char s[MAXN], t[MAXN];int win, lose, chance, left, lens, lent;void guess(char c){ int bad, i; bad = TRUE; for(i=0; i<lens; i++) if(s[i] == c) { if(--left == 0) { win = 1; return; } s[i] = ' '; bad = FALSE; } if(bad) if(--chance == 0) lose = TRUE;}int main(void){ int round, i; while(scanf("%d%s%s", &round, s, t) != EOF && round != -1) { printf("Round %d\n", round); left = lens = strlen(s); lent = strlen(t); win = lose = FALSE; chance = 7; for(i=0; i<lent; i++) { guess(t[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。
1 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
- Android酷炫实用的开源框架(UI框架)
- 前端跨域解决办法之JSONP
- leetcode(187):Repeated DNA Sequences
- phpexcel
- 为什么说移动一个元素用Translate()比Pos:abs Top/Left好?
- UVA489 Hangman Judge
- POJ 1236 Network of Schools 强连通分量
- TCP协议中的三次握手和四次挥手(图解)
- 搜狐视频助手,广告联盟必备,安全稳定增加浏览量提升人气
- java IO流的详细介绍
- 喜欢的话
- hadoopHA安装部署测试
- Multi-view Face Detection Using Deep Convolutional Neural Networks, ICMR 15.
- HDU 5446 Unknown Treasure [lucas+CRT]【数论】