简单题
来源:互联网 发布:产品目录软件 编辑:程序博客网 时间:2024/05/17 17:45
原题http://acm.hdu.edu.cn/showproblem.php?pid=4950
Monster
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 566 Accepted Submission(s): 231
Problem Description
Teacher Mai has a kingdom. A monster has invaded this kingdom, and Teacher Mai wants to kill it.
Monster initially has h HP. And it will die if HP is less than 1.
Teacher Mai and monster take turns to do their action. In one round, Teacher Mai can attack the monster so that the HP of the monster will be reduced by a. At the end of this round, the HP of monster will be increased by b.
After k consecutive round's attack, Teacher Mai must take a rest in this round. However, he can also choose to take a rest in any round.
Output "YES" if Teacher Mai can kill this monster, else output "NO".
Monster initially has h HP. And it will die if HP is less than 1.
Teacher Mai and monster take turns to do their action. In one round, Teacher Mai can attack the monster so that the HP of the monster will be reduced by a. At the end of this round, the HP of monster will be increased by b.
After k consecutive round's attack, Teacher Mai must take a rest in this round. However, he can also choose to take a rest in any round.
Output "YES" if Teacher Mai can kill this monster, else output "NO".
Input
There are multiple test cases, terminated by a line "0 0 0 0".
For each test case, the first line contains four integers h,a,b,k(1<=h,a,b,k <=10^9).
For each test case, the first line contains four integers h,a,b,k(1<=h,a,b,k <=10^9).
Output
For each case, output "Case #k: " first, where k is the case number counting from 1. Then output "YES" if Teacher Mai can kill this monster, else output "NO".
Sample Input
5 3 2 20 0 0 0
Sample Output
Case #1: NO
#include <stdio.h>#include <stdlib.h>#include <malloc.h>#include <limits.h>#include <ctype.h>#include <string.h>#include <string>#include <math.h>#include <algorithm>#include <iostream>#include <stack>#include <queue>#include <deque>#include <vector>#include <set>#include <map>using namespace std;int main(){ __int64 cas=1; __int64 h,a,b,k; while(~scanf("%I64d%I64d%I64d%I64d",&h,&a,&b,&k)){ if(h==0 && a==0 && b==0 && k==0){ break; } if(h <= a){ printf("Case #%I64d: YES\n",cas++); continue; } if(a <= b){ printf("Case #%I64d: NO\n",cas++); continue; } if(h-(a-b)*(k-1)-a <= 0){//K回合之内就打败了,不能回血。 printf("Case #%I64d: YES\n",cas++); continue; } if(h-(a-b)*(k)+b < h){ printf("Case #%I64d: YES\n",cas++); continue; } else{ printf("Case #%I64d: NO\n",cas++); } } return 0;}
0 0
- 简单题
- 简单题
- 简单题
- 简单题
- 简单题
- 简单题
- 简单题
- 简单题
- 简单题
- NYOJ 821 简单求值【简单题】
- 简单比较中的题
- 一道简单题,劳神。。。
- 词语接龙【简单题】
- UVa 10055 简单题
- 简单逻辑题
- 简单的继承题
- 一道简单题
- C++简单笔试题
- android ImageButton 和Button的图标区别
- oracle table modified
- 深入理解计算机系统之异常控制流----fork打印问题
- 八大排序算法
- Android 多线程下载
- 简单题
- 使用jquery获取url以及jquery获取url参数的方法
- 翻译www.djangobook.com之第八章:高级视图和URL配置
- Oracle建立全文索引详解
- IPV6编程
- DIV CSS 网页兼容全搞定 (IE6 IE7 IE8 IE9 火狐 谷歌)
- PHP 定位城市
- mysql 中定时执行存储过程
- CSS中id与class命名规则及编码最佳习惯