The Magic Tower

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 0 Accepted Submission(s): 0

Problem Description

Like most of the RPG (role play game), “The Magic Tower” is a game about how a warrior saves the princess.
After killing lots of monsters, the warrior has climbed up the top of the magic tower. There is a boss in front of him. The warrior must kill the boss to save the princess.
Now, the warrior wants you to tell him if he can save the princess.

Input

There are several test cases.
For each case, the first line is a character, “W” or “B”, indicating that who begins to attack first, ”W” for warrior and ”B” for boss. They attack each other in turn.
The second line contains three integers, W_HP, W_ATK and W_DEF. (1<=W_HP<=10000, 0<=W_ATK, W_DEF<=65535), indicating warrior’s life point, attack value and defense value.
The third line contains three integers, B_HP, B_ATK and B_DEF. (1<=B_HP<=10000, 0<=B_ATK, B_DEF<=65535), indicating boss’s life point, attack value and defense value.

Note: warrior can make a damage of (W_ATK-B_DEF) to boss if (W_ATK-B_DEF) bigger than zero, otherwise no damage. Also, boss can make a damage of (B_ATK-W_DEF) to warrior if (B_ATK-W_DEF) bigger than zero, otherwise no damage.

Output

For each case, if boss’s HP first turns to be smaller or equal than zero, please print ”Warrior wins”. Otherwise, please print “Warrior loses”. If warrior cannot kill the boss forever, please also print ”Warrior loses”.

Sample Input

W 100 1000 900 100 1000 900 B 100 1000 900 100 1000 900

Sample Output

Warrior wins Warrior loses

AC:

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{int a,b,c,a1,b1,c1;char s;int l,k;while(cin>>s>>a>>b>>c>>a1>>b1>>c1){l=b-c1;k=b1-c;if(s=='W'){while(1){if(l<=0){printf("Warrior loses\n");break;}else {a1=a1-l;if(a1<=0){printf("Warrior wins\n");break;}a=a-k;if(a<=0){printf("Warrior loses\n");break;}}}}else{while(1){if(l<=0){printf("Warrior loses\n");break;}else {a=a-k;if(a<=0){printf("Warrior loses\n");break;}a1=a1-l;if(a1<=0){printf("Warrior wins\n");break;}}}}}return 0;
}

The Magic Tower相关推荐

Python游戏开发，Pygame模块，Python从零开始带大家实现一个魔塔小游戏
开发工具 Python版本: 3.7.4 相关模块: pygame模块: 以及一些python自带的模块. 环境搭建安装Python并添加到环境变量,pip安装需要的相关模块即可. 原理简介首先, ...
python3.7魔塔游戏_基于Funcode平台的“火锅版魔塔”游戏开发与设计
2019 年第 2 期信息与电脑 China Computer & Communication 软件开发与应用基于 Funcode 平台的"火锅版魔塔"游戏开发与设计 ...
HDU3698-Let the light guide us (线段树优化的dp)
Plain of despair was once an ancient battlefield where those brave spirits had rested in peace for t ...
童年经典回忆 | 从零开始带大家用Python撸一个魔塔小游戏呀（1）
相关文件相关游戏素材(图片和音频等)源于网络,侵歉删. 需要源代码的小伙伴私信小编,或者关注小编的公众号[Python日志] 开发工具 Python版本:3.7.4 相关模块: pygame模块: ...
Python游戏编程实践2：魔塔
Python游戏编程实践2:魔塔前言运行前言在逗游游戏盒上玩了一个名叫<魔塔>的游戏,感觉颇有心得体会."与其临渊羡鱼,不如退而结网",使用Python语言编写 ...
Hanoi Tower Troubles Again!
题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1239 题目描述: Time Limit: 2 Seconds ...
本周大新闻｜传Meta与Magic Leap谈专利授权；PS VR2前6周出货60万台
本周XR大新闻,AR方面,苹果XR项目核心高管曝光:传Meta与Magic Leap洽谈专利授权合作:歌尔光学公布新一代AR显示模组:Lumus公布二代波导Z-Lens最新细节:JBD X-cube发 ...
Educational Codeforces Round 9 F. Magic Matrix 最小生成树
F. Magic Matrix 题目连接: http://www.codeforces.com/contest/632/problem/F Description You're given a mat ...
我花了三个小时写了一道题的六千字题解....（POJ 2888 Magic Bracelet）
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划前置知识:小学生都能看懂的群论从入门到升天教程 <群论全家桶> 一道简单的题目 Probl ...

The Magic Tower

The Magic Tower

The Magic Tower相关推荐

最新文章

热门文章