2015’12杭电校赛1009 The Magic Tower（水题快上！）

原创

mb6482f4889edbd 2023-06-12 14:11:14 博主文章分类：水题 ©著作权

文章标签 #include #define Java 文章分类 JavaScript 前端开发

©著作权归作者所有：来自51CTO博客作者mb6482f4889edbd的原创作品，请联系作者获取转载授权，否则将追究法律责任

题解：

水题

代码

#include <bits/stdc++.h>
#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <bitset>
#define MAX 100000
#define LL long long
using namespace std;
int cas=1,T,w1,w2,w3,b1,b2,b3;
char op[2];
int main()
{
    while(scanf("%s",op)!=EOF )
    {
        scanf("%d%d%d",&w1,&w2,&w3);
        scanf("%d%d%d",&b1,&b2,&b3);
        w2-=b3;b2-=w3;
        if(w2<=0) 
        { 
            printf("Warrior loses\n");
            continue; 
        }
        if(b2<=0) 
        { 
            printf("Warrior wins\n");
            continue; 
        }
        int wt,bt;
        wt=b1/w2+(b1%w2?1:0);
        bt=w1/b2+(w1%b2?1:0);
        if(op[0]=='W')
        {
            if(wt<=bt) 
                printf("Warrior wins\n");
            else 
                printf("Warrior loses\n");
        }
        else
        {
            if(bt<=wt) 
                printf("Warrior loses\n");
            else 
                printf("Warrior wins\n");
        }
    }
      return 0;
}

题目

The Magic Tower

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

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”.