bjwjc

UID: 910, 注册于 2024-4-2 10:33:16, 最后登录于 2025-10-30 16:08:06, 最后活动于 2025-10-30 16:47:15.

解决了 4 道题目，RP: 6 (No. 142)

♂

个人简介

挖矿小游戏 O(∩_∩)O

公告栏：
1.3.2版本：
【市场】增加镐子价格

#include <bits/stdc++.h>
#include <windows.h>
#include <conio.h>
using namespace std;
long long qian, p, ks, rlsx = 9 * 8 * 64, ys, nnk, tk1, tk2, lk, tk3, sc, kk = 1, yj, yjnj;
long long lhy, ym, syk, xnk, cyk, gk,q = 1, rl, r, x, ifx, gdj = 1, kdj, myxsk, xts, zys, smbz, wk;
long long yqmz;
long long gz[10] = {0, 6000, 12000, 30000, 60000, 150000, 600000, 1000000};
string s;
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;
			qian = qian + lhy * 5 + ym * 7 + syk * 15 + xnk * 25 + cyk * 30 + gk * 40;
			qian = qian + myxsk * 10 + lk * 15 + xts * 30 + zys * 35 + smbz * 50 + wk * 60;
			rl = ys = nnk = tk1 = tk2 = lk = tk3 = 0;
			lhy = ym = syk = xnk = cyk = gk = 0;
			myxsk = lk = xts = zys = smbz = wk = 0;
			system("cls");
		}
		slow("钱："), cout << qian, slow("$\n要干什么？\n1.去矿场 2.去市场 3.签到 4.自动出售 5.挂机 6.退游\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字符，如果矿镐等级够高，会获得1矿石，但等级不足时，无法挖掘该矿石。"); 
							Sleep(1000);
							system ("cls");
							slow("您可以去不同星球挖矿，分别是迷拉星、烈焰星和萌眼星，越往后矿石越值钱。");
							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));
				slow("你要去哪个星球？\n1.迷拉星 2.烈焰星 3.萌眼星\n");
				cin >> p;
				system("cls");
				if (p == 1) {
					while (1) {
						x = yj = 0;
						s = "";
						x = rand() % 1000 + 1;
						if (x <= 450) s = "岩石", kdj = 1;
							else if (x <= 750) s = "凝能矿", kdj = 1;
								else if (x <= 900) s = "铜矿", kdj = 1;
									else if (x <= 960) s = "铁矿", kdj = 2;
										else if (x <= 985) s = "铝矿", kdj = 3;
											else if (x <= 995) s = "钛矿", kdj = 4;
												else s = "岩浆", yj = 1;
						cout << "背包：" << rl << "/" << rlsx << endl;
						cout << "按w字符挖掘，按t字符跳过，按h字符回到主页。\n";
						cout << "矿镐等级：" << gdj <<"\t\t当前矿石：" << s << "\n";
						cout << "岩浆背包耐久：" << yjnj << "\n";
						if (yj == 1) {
							if (yjnj > 0) {
								slow("岩浆背包耐久-1");
								Sleep(1000);
								yjnj--;
								system("cls");
								continue;
							}
							else {
								Sleep(1000);
								slow("你被岩浆烫死了！即将在主页复活但金钱减半！");
								Sleep(500);
								qian = qian / 2;
								system("cls");
								break;
							}
						}
						zf = _getch();
						Sleep(200);
						if (zf == 'w') {
							if (gdj >= kdj) {
								system("cls");
								for (int i = 1; i <= 8 - gdj + kdj; i++) {
									cout << "正在挖掘（" << i << "/" << 4 - gdj + kdj << "）";
									Sleep(1000);
									system("cls");
								}
								rl++;
								if (s == "岩石") ys++;
								if (s == "凝能矿") nnk++;
								if (s == "铜矿") tk1++;
								if (s == "铁矿") tk2++;
								if (s == "铝矿") lk++;
								if (s == "钛矿") tk3++;
							}
							else {
								slow("无法挖掘！");
								Sleep(1000);
								system("cls");
								continue;
							}
						}
						else if (zf == 'h') {
							system ("cls");
							break;
						}
						else if (zf == 't') {
							slow("已跳过！");
							Sleep(1000);
							system("cls");
							continue;
						}
						if (rl == rlsx) {
							system("cls");
							slow("背包已满！"),
							Sleep(1000);
							system("cls");
							break;
						}
						system("cls");
					}
				}
				else if (p == 2) {
					slow("温馨提示：在烈焰星遍布岩浆，请装备好岩浆背包。");
					Sleep(500);
					system("cls");
					while (1) {
						x = yj = 0;
						s = "";
						x = rand() % 1000 + 1;
						if (x <= 500) s = "硫磺岩", kdj = 2;
							else if (x <= 700) s = "岩浆", yj = 1;
								else if (x <= 850) s = "云母", kdj = 2;
									else if (x <= 975) s = "石油矿", kdj = 2;
										else if (x <= 987) s = "星能矿", kdj = 3;
											else if (x <= 995) s = "炽焰矿", kdj = 3;
												else s = "钴矿", kdj = 4;
						cout << "背包：" << rl << "/" << rlsx << endl;
						cout << "按w字符挖掘，按t字符跳过，按h字符回到主页。\t\t矿镐等级：" << gdj <<"\t\t当前矿石：" << s << "\n";
						cout << "岩浆背包耐久：" << yjnj << "\n"; 
						if (yj == 1) {
							if (yjnj > 0) {
								slow("岩浆背包耐久-1");
								Sleep(1000);
								yjnj--;
								system("cls"); 
								continue;
							}
							else {
								Sleep(1000);
								slow("你被岩浆烫死了！即将在主页复活但金钱减半！");
								Sleep(500);
								qian = qian / 2;
								system("cls");
								break;
							}
						}
						zf = _getch();
						Sleep(200);
						if (zf == 'w') {
							if (gdj >= kdj) {
								system("cls");
								for (int i = 1; i <= 8 - gdj + kdj; i++) {
									cout << "正在挖掘（" << i << "/" << 6 - gdj + kdj << "）";
									Sleep(1000);
									system("cls");
								}
								rl++;
								if (s == "硫磺岩") lhy++;
								if (s == "云母") ym++;
								if (s == "石油矿") syk++;
								if (s == "星能矿") xnk++;
								if (s == "炽焰矿") cyk++;
								if (s == "钴矿") gk++;
							}
							else {
								slow("无法挖掘！");
								Sleep(1000);
								system("cls");
								continue;
							}
						}
						else if (zf == 'h') {
							system ("cls");
							break;
						}
						else if (zf == 't') {
							slow("已跳过！");
							Sleep(1000);
							system("cls");
							continue;
						}
						if (rl == rlsx) {
							system("cls");
							slow("背包已满！"),
							Sleep(1000);
							system("cls");
							break;
						}
						system("cls");
					}
				}
				else if (p == 3) {
					slow("温馨提示：在萌眼星没有氧气，挖掘时间翻倍，装备氧气背包就没有问题。");
					Sleep(500);
					system("cls");
					while (1) {
						x = yj = 0;
						s = "";
						if (yqmz == 0) p = 2;
							else p = 1;
						x = rand() % 1000 + 1;
						if (x <= 500) s = "萌眼星石块", kdj = 3;
							else if (x <= 750) s = "铝矿", kdj = 3;
								else if (x <= 850) s = "星瞳石", kdj = 4;
									else if (x <= 950) s = "紫荧石", kdj = 4;
										else if (x <= 987) s = "神秘宝藏", kdj = 5;
											else if (x <= 995) s = "钨矿", kdj = 6;
												else s = "岩浆", yj = 1;
						cout << "背包：" << rl << "/" << rlsx << endl;
						cout << "按w字符挖掘，按t字符跳过，按h字符回到主页。\t\t矿镐等级：" << gdj <<"\t\t当前矿石：" << s << "\n";
						cout << "岩浆背包耐久：" << yjnj << "\n";
						cout << "氧气面罩耐久：" << yqmz << "\n";
						if (yj == 1) {
							if (yjnj > 0) {
								slow("岩浆背包耐久-1");
								Sleep(1000);
								yjnj--;
								system("cls");
								continue;
							}
							else {
								Sleep(1000);
								slow("你被岩浆烫死了！即将在主页复活但金钱减半！");
								Sleep(500);
								qian = qian / 2;
								system("cls");
								break;
							}
						}
						zf = _getch();
						Sleep(200);
						if (zf == 'w') {
							if (gdj >= kdj) {
								system("cls");
								for (int i = 1; i <= 8 * p - gdj + kdj; i++) {
									cout << "正在挖掘（" << i << "/" << 8 * p - gdj + kdj << "）";
									Sleep(1000);
									system("cls");
								}
								rl++;
								if (s == "萌眼星石块") myxsk++;
								if (s == "铝矿") lk++;
								if (s == "星瞳石") xts++;
								if (s == "紫荧石") zys++;
								if (s == "神秘宝藏") smbz++;
								if (s == "钨矿") wk++;
								if (yqmz > 0) {
									system("cls");
									slow("氧气面罩耐久-1");
									Sleep(500);
									yqmz--;
								}
							}
							else {
								slow("无法挖掘！");
								Sleep(1000);
								system("cls");
								continue;
							}
						}
						else if (zf == 'h') {
							system ("cls");
							break;
						}
						else if (zf == 't') {
							slow("已跳过！");
							Sleep(1000);
							system("cls");
							continue;
						}
						if (rl == rlsx) {
							system("cls");
							slow("背包已满！"),
							Sleep(1000);
							system("cls");
							break;
						}
						system("cls");
					}
				}
				system("cls");
				while(_kbhit()) _getch();
				break;
			case 2:
				system("cls");
				slow("您要干什么？\n1.卖出矿石 2.购买矿镐 3.购买星球武器\n");
				cin >> p;
				switch (p) {
					case 1:
						system("cls");
						slow("您要全部卖出矿石吗？");
						cin >> p;
						system("cls");
						if (p == 1) {
							slow("已全部出售！");
							Sleep(1000);
							qian = qian + ys * 2 + nnk * 3 + tk1 * 5 + tk2 * 10 + lk * 15 + tk3 * 20;
							qian = qian + lhy * 5 + ym * 7 + syk * 15 + xnk * 25 + cyk * 30 + gk * 40;
							qian = qian + myxsk * 10 + lk * 15 + xts * 30 + zys * 35 + smbz * 50 + wk * 60;
							rl = ys = nnk = tk1 = tk2 = lk = tk3 = 0;
							lhy = ym = syk = xnk = cyk = gk = 0;
							myxsk = lk = xts = zys = smbz = wk = 0;
							system("cls");
						}
						else {
							system("cls");
							slow("已取消。");
							Sleep(1000);
							system("cls");
						}
						system("cls");
						break;
					case 2:
						system("cls");
						slow("1.黄铜镐\t\t等级：2\t\t价格：6000$\n");
						slow("2.铸铁镐\t\t等级：3\t\t价格：12000$\n");
						slow("3.铝合金镐\t\t等级：4\t\t价格：30000$\n");
						slow("4.钛合金镐\t\t等级：5\t\t价格：60000$\n");
						slow("5.钴合金镐\t\t等级：6\t\t价格：150000$\n");
						slow("6.电钻\t\t\t等级：7\t\t价格：600000$\n");
						slow("7.星瞳电钻\t\t等级：8\t\t价格：1000000$\n");
						slow("您要买什么镐子（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;
									break;
								case 2:
									gdj = 3;
									break;
								case 3:
									gdj = 4;
									break;
								case 4:
									gdj = 5;
									break;
								case 5:
									gdj = 6;
									break;
								case 6:
									gdj = 7;
									break;
								case 7:
									gdj = 8;
									break;
							}
							qian = qian - gz[p];
						}
						else slow("购买失败！");
						Sleep(1000);
						system("cls");
						break;
					case 3:
						system("cls");
						slow("您要买什么？\n1.岩浆背包 2.氧气面罩\n");
						cin >> p;
						if (p == 1) {
							system("cls");
							slow("属性：能抵御岩浆但-1耐久，共2000耐久。\t价格：20000$\n是否购买？\n");
							cin >> p;
							if (p == 1) {
								system("cls");
								if (qian >= 20000) {
									qian = qian - 20000;
									yjnj = 2000;
									cout << "购买成功！";
								}
								else cout << "购买失败！";
								Sleep(1000);
								system("cls");
							}
							else {
								system("cls");
								cout << "已取消。";
								Sleep(1000);
								system("cls");
							}
							system("cls");
						}
						else if (p == 2) {
							system("cls");
							slow("属性：能抵御缺氧的恶劣环境但-1耐久，共5000耐久。\n价格：50000$\n是否购买？\n");
							cin >> p;
							if (p == 1) {
								system("cls");
								if (qian >= 50000) {
									qian = qian - 50000;
									yqmz = 5000;
									cout << "购买成功！";
								}
								else cout << "购买失败！";
								Sleep(1000);
								system("cls");
							}
						}
				}
				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("大凶，扣除100$");
						qian = qian - 100;
						Sleep(1000);
						system("cls");
						r = 1;
						system("color 07");
						break;
					case 2:
						system("color 0C");
						slow("凶，扣除50$");
						qian = qian - 50;
						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("小吉，加30$");
						qian = qian + 30;
						Sleep(1000);
						system("cls");
						r = 1;
						system("color 07");
						break;
					case 5:
						system("color 0A");
						slow("吉，加60$");
						qian = qian + 60;
						Sleep(1000);
						system("cls");
						r = 1;
						system("color 07");
						break;
					case 6:
						system("color 03");
						slow("中吉，加100$");
						qian = qian + 100;
						Sleep(1000);
						system("cls");
						r = 1;
						system("color 07");
						break;
					case 7:
						system("color 02");
						slow("大吉，加150$");
						qian = qian + 150;
						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("请输入你想挂机的时长，每五秒产生一次金额（单位：5秒，0退出）\n");
				cin >> p;
				sc = 0;
				if(p == 0) {
					system("cls");
					break;
				}
				p--;
				while (1) {
					system("cls");
					cout << "钱：" << qian << "$\n";
					switch(gdj) {
						case 1:
							slow("+1$");
							qian = qian + 1;
							break;
						case 2:
							slow("+2$");
							qian = qian + 2;
							break;
						case 3:
							slow("+3$");
							qian = qian + 3;
							break;
						case 4:
							slow("+4$");
							qian = qian + 4;
							break;
						case 5:
							slow("+5$");
							qian = qian + 5;
							break;
						case 6:
							slow("+6$");
							qian = qian + 6;
							break;
						case 7:
							slow("+7$");
							qian = qian + 7;
							break;
						case 8:
							slow("+8$");
							qian = qian + 8;
							break;
					}
					Sleep(5000);
					if (sc == p) break;
					sc++;
				}
				system("cls");
				break;
			case 6:
				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

个人简介

通过的题目

最近活动

最近编写的题解

状态

开发

支持

还没有账户？

登录