[土狗之路]coursera 北京大学C++ 魔兽世界：装备

上课加上乱七八糟的事情，好久没有更新博客，现在开始继续更新。

直接上题：

编程题＃2： 魔兽世界之二：装备

来源: POJ (Coursera声明：在POJ上完成的习题将不会计入Coursera的最后成绩。)

注意： 总时间限制: 1000ms 内存限制: 65536kB

描述

魔兽世界的西面是红魔军的司令部，东面是蓝魔军的司令部。两个司令部之间是依次排列的若干城市。

红司令部，City 1，City 2，……，City n，蓝司令部

两军的司令部都会制造武士。武士一共有 dragon 、ninja、iceman、lion、wolf 五种。每种武士都有编号、生命值这两种属性。

有的武士可以拥有武器。武器有三种，sword, bomb,和arrow，编号分别为0,1,2。

双方的武士编号都是从1开始计算。红方制造出来的第 n 个武士，编号就是n。同样，蓝方制造出来的第 n 个武士，编号也是n。

不同的武士有不同的特点。

dragon 可以拥有一件武器。编号为n的dragon降生时即获得编号为 n%3 的武器。dragon还有“士气”这个属性，是个浮点数，其值为它降生后其司令部剩余生命元的数量除以造dragon所需的生命元数量。

ninjia可以拥有两件武器。编号为n的ninjia降生时即获得编号为 n%3 和 (n+1)%3的武器。

iceman有一件武器。编号为n的iceman降生时即获得编号为 n%3 的武器。

lion 有“忠诚度”这个属性，其值等于它降生后其司令部剩余生命元的数目。

wolf没特点。

请注意，在以后的题目里，武士的士气，生命值，忠诚度在其生存期间都可能发生变化，都有作用，武士手中的武器随着使用攻击力也会发生变化。

武士在刚降生的时候有一个生命值。

在每个整点，双方的司令部中各有一个武士降生。

红方司令部按照 iceman、lion、wolf、ninja、dragon 的顺序循环制造武士。

蓝方司令部按照 lion、dragon、ninja、iceman、wolf 的顺序循环制造武士。

制造武士需要生命元。

制造一个初始生命值为 m 的武士，司令部中的生命元就要减少 m 个。

如果司令部中的生命元不足以制造某个按顺序应该制造的武士，那么司令部就试图制造下一个。如果所有武士都不能制造了，则司令部停止制造武士。

给定一个时间，和双方司令部的初始生命元数目，要求你将从0点0分开始到双方司令部停止制造武士为止的所有事件按顺序输出。

一共有两种事件，其对应的输出样例如下：

1) 武士降生

输出样例： 004 blue lion 5 born with strength 5,2 lion in red headquarter

表示在 4点整，编号为5的蓝魔lion武士降生，它降生时生命值为5,降生后蓝魔司令部里共有2个lion武士。(为简单起见，不考虑单词的复数形式)注意，每制造出一个新的武士，都要输出此时司令部里共有多少个该种武士。

如果造出的是dragon，那么还要输出一行，例：

It has a arrow,and it's morale is 23.34

表示该dragon降生时得到了arrow,其士气是23.34（为简单起见，本题中arrow前面的冠词用a,不用an，士气精确到小数点后面2位，四舍五入）

如果造出的是ninjia，那么还要输出一行，例：

It has a bomb and a arrow

表示该ninjia降生时得到了bomb和arrow。

如果造出的是iceman，那么还要输出一行，例：

It has a sword

表示该iceman降生时得到了sword。

如果造出的是lion，那么还要输出一行，例：

It's loyalty is 24

表示该lion降生时的忠诚度是24。

2) 司令部停止制造武士

输出样例： 010 red headquarter stops making warriors

表示在 10点整，红方司令部停止制造武士

输出事件时：

首先按时间顺序输出；

同一时间发生的事件，先输出红司令部的，再输出蓝司令部的。

输入

第一行是一个整数,代表测试数据组数。

每组测试数据共两行。

第一行，一个整数M。其含义为： 每个司令部一开始都有M个生命元( 1 <= M <= 10000)

第二行：五个整数，依次是 dragon 、ninja、iceman、lion、wolf 的初始生命值。它们都大于0小于等于10000

输出

对每组测试数据，要求输出从0时0分开始，到双方司令部都停止制造武士为止的所有事件。

对每组测试数据，首先输出“Case:n" n是测试数据的编号，从1开始

接下来按恰当的顺序和格式输出所有事件。每个事件都以事件发生的时间开头，时间以小时为单位，有三位。

样例输入

1
20
3 4 5 6 7

样例输出

Case:1
000 red iceman 1 born with strength 5,1 iceman in red headquarter
It has a bomb
000 blue lion 1 born with strength 6,1 lion in blue headquarter
It's loyalty is 14
001 red lion 2 born with strength 6,1 lion in red headquarter
It's loyalty is 9
001 blue dragon 2 born with strength 3,1 dragon in blue headquarter
It has a arrow,and it's morale is 3.67
002 red wolf 3 born with strength 7,1 wolf in red headquarter
002 blue ninja 3 born with strength 4,1 ninja in blue headquarter
It has a sword and a bomb
003 red headquarter stops making warriors
003 blue iceman 4 born with strength 5,1 iceman in blue headquarter
It has a bomb
004 blue headquarter stops making warriors

然后开始放代码了：

#include 
#include    
#include    
using namespace std;
const int redOrder[5] = { 2,3,4,1,0 };
const int blueOrder[5] = { 3,0,1,2,4 };
int HPs[5];
int minHP;
class Weapon//武器类，提前为后面的终极版打好基础
{
};
class Sword : public Weapon {};
class Bomb : public Weapon {};
class Arrow : public Weapon {};
class warrior//基类
{
private:
	int ID;
	string color;
	int HP;
public: warrior(int ID, string color, int i) {
	this->color = color;
	HP = HPs[i];
	this->ID = ID;
};
public: warrior() {};//默认构造函数，没有这个后面会派生类会报错，不知道为什么！
};
class dragon :public warrior//派生类    
{
private:
	Weapon * weapon1;
	double morale;
public:
	dragon(string color, int n, int power) {
		warrior(n, color, 0);
		{
			morale = (double)(power - HPs[0]) / HPs[0];
			int k = n % 3;
			switch (k) {
			case 0:
				weapon1 = new Sword();
				break;
			case 1:
				weapon1 = new Bomb();
				break;
			case 2:
				weapon1 = new Arrow();
				break;
			}
		};
	};
};
class ninja :public warrior
{
private: Weapon * weapon1;
		 Weapon * weapon2;
public: ninja(string color, int n) {
	warrior(n, color, 1)
		; {
		int k = n % 3;
		switch (k) {
		case 0:
			weapon1 = new Sword();
			break;
		case 1:
			weapon1 = new Bomb();
			break;
		case 2:
			weapon1 = new Arrow();
			break;
		}
		int j = (n + 1) % 3;
		switch (j) {
		case 0:
			weapon2 = new Sword();
			break;
		case 1:
			weapon2 = new Bomb();
			break;
		case 2:
			weapon2 = new Arrow();
			break;
		}
	};
};
};
class iceman :public warrior
{
private:Weapon * weapon1;
public: iceman(string color, int n) {
		warrior(n, color, 2)
			; {
			int k = n % 3;
			switch (k) {
			case 0:
				weapon1 = new Sword();
				break;
			case 1:
				weapon1 = new Bomb();
				break;
			case 2:
				weapon1 = new Arrow();
				break;
			}
		};
};
};
class lion :public warrior
{
private: int loyalty;
public: lion(string color, int n, int power) {
	warrior(n, color, 3)
		; {
		loyalty = power - HPs[3];
	};
};
};
class wolf :public warrior
{
public: wolf(string color, int n) {
	warrior(n, color, 4);
};
};
class headOffice
{
private:
	int power;
	string color;
	int numberOfWarrior;//总兵数    
	bool carryOn;//是否继续造兵    
	int each[5];//每种兵的数量    
	int current;//当前轮换造兵的顺序    
	int select;//当前要造的兵  
public:
	headOffice(int power, string color)
	{
		this->color = color; this->power = power; carryOn = true; numberOfWarrior = 0; current = 0;
		each[0] = 0; each[1] = 0; each[2] = 0; each[3] = 0; each[4] = 0;
	};
	bool getCarryOn() {
		return carryOn;
	}
	bool create(string color) {
		cout << color;
		int HPOrder[5];
		for (int i = 0; i <= 4; i++) {
			if (color == "red")
				HPOrder[i] = HPs[redOrder[i]];
			if (color == "blue")
				HPOrder[i] = HPs[blueOrder[i]];
		};
		if (power >= minHP == false) {
			cout << " headquarter stops making warriors" << endl;
			carryOn = false;
			return false;
		}
		while (power >= minHP) {
			if (power >= HPOrder[current])
				break;
			if (current == 4)
				current = 0;
			else
				current++;
		}
		//根据不同颜色，调取不同颜色的造兵顺序
		if (color == "red")
			select = redOrder[current];
		if (color == "blue")
			select = blueOrder[current];
		string warriors[5] = { " dragon "," ninja "," iceman "," lion "," wolf " };//储存五种不同兵种的名字
		string weapons[3] = { "sword","bomb","arrow" };
		switch (select) {//根据不同的兵种，进行制造 ，打印造兵我放在了总基地class里面，因为造兵是他的功能。而且将打印与创造对象分成了两部分
		case 0:new dragon(color, numberOfWarrior + 1, power); each[0]++; power = power - HPs[0]; numberOfWarrior++;
			cout << warriors[select] << numberOfWarrior << " born with strength " << HPs[select] << "," << each[select] << warriors[select] << "in " << color << " headquarter" << endl;
			cout << "It has a " << weapons[(numberOfWarrior % 3)] << ",and it's morale is " << setprecision(2) << fixed << (double)power / HPs[0] << endl;
			if (current == 4) current = 0;
			else
				current++; break;
		case 1:new ninja(color, numberOfWarrior + 1); each[1]++; power = power - HPs[1];  numberOfWarrior++;
			cout << warriors[select] << numberOfWarrior << " born with strength " << HPs[select] << "," << each[select] << warriors[select] << "in " << color << " headquarter" << endl;
			cout << "It has a " << weapons[(numberOfWarrior % 3)] << " and a " << weapons[(numberOfWarrior + 1) % 3] << endl;
			if (current == 4)
				current = 0;
			else
				current++;  break;
		case 2:new iceman(color, numberOfWarrior + 1); each[2]++; power = power - HPs[2];  numberOfWarrior++;
			cout << warriors[select] << numberOfWarrior << " born with strength " << HPs[select] << "," << each[select] << warriors[select] << "in " << color << " headquarter" << endl;
			cout << "It has a " << weapons[(numberOfWarrior % 3)] << endl;
			if (current == 4)
				current = 0;
			else
				current++;  break;
		case 3:new lion(color, numberOfWarrior + 1, power); each[3]++; power = power - HPs[3];  numberOfWarrior++;
			cout << warriors[select] << numberOfWarrior << " born with strength " << HPs[select] << "," << each[select] << warriors[select] << "in " << color << " headquarter" << endl;
			cout << "It's loyalty is " << power << endl;
			if (current == 4)
				current = 0;
			else
				current++;  break;
		case 4:new wolf(color, power); each[4]++; power = power - HPs[4]; numberOfWarrior++;
			cout << warriors[select] << numberOfWarrior << " born with strength " << HPs[select] << "," << each[select] << warriors[select] << "in " << color << " headquarter" << endl;
			if (current == 4)
				current = 0;
			else
				current++;  break;
		}
		return true;
	}
};
int main() {
	int n, m;
	minHP = 0;
	cin >> n;
	for (int j = 0; j < n; j++) {
		cin >> m;
		for (int i = 0; i <= 4; i++) {
			cin >> HPs[i];
		}
		cout << "Case:" << j + 1 << endl;
		minHP = HPs[0];
		for (int i = 0; i <= 4; i++) {
			if (HPs[i] < minHP)
				minHP = HPs[i];
		}
		headOffice redHeadoffice(m, "red"), blueHeadoffice(m, "blue");
		int time = 0;//游戏时钟    
		while (redHeadoffice.getCarryOn() == true || blueHeadoffice.getCarryOn() == true) {
			if (redHeadoffice.getCarryOn() == true) {
				cout << setfill('0') << setw(3) << time << ' ';
				redHeadoffice.create("red");
			}
			if (blueHeadoffice.getCarryOn() == true) {
				cout << setfill('0') << setw(3) << time << ' ';
				blueHeadoffice.create("blue");
			}
			time++;//每一轮结束，时间+1
		}
	}
	return 0;
}