简单解方程

状态	递交者	时间	内存	语言	代码	递交时间
AC	郑妍汐	14ms	384 KiB		138 Bytes	2022-2-22 0:03:55
AC	hnd (陈皓洋)	14ms	388 KiB		267 Bytes	2022-9-3 17:14:36
AC	Cristiano·Ronaldo (05c41-gmz)	14ms	444 KiB		107 Bytes	2022-7-26 8:43:03
AC	11451254188 (22029-mjh)	14ms	436 KiB		134 Bytes	2022-11-23 13:36:42
AC	Him神	14ms	6.8 MiB		138 Bytes	2023-10-4 21:21:07
AC	李林峰 (金克拉)	14ms	512 KiB		116 Bytes	2022-12-9 19:00:15
AC	MacrozClick_ (蒋淞霖)	14ms	384 KiB		150 Bytes	2022-2-10 15:50:32
AC	在煎鱼的肖大总铳 (肖宇航)	14ms	440 KiB		160 Bytes	2022-8-10 10:52:32
AC	cainuoyan	14ms	7.2 MiB	C++98	100 Bytes	2024-4-21 10:18:46
AC	明哲瀚 (18580067605)	14ms	432 KiB		118 Bytes	2022-10-3 13:27:21
AC	金沙校区-李嘉齐 (李嘉齐)	14ms	7.1 MiB	C++98	113 Bytes	2024-5-14 20:49:17
AC	zjz	14ms	512 KiB		112 Bytes	2022-3-18 18:16:57
AC	wangzhijie	14ms	384 KiB		148 Bytes	2022-2-19 13:42:25
AC	希蒙 (zhengxingya)	14ms	7.4 MiB		102 Bytes	2023-6-10 20:27:22
AC	NJL (NJlL)	14ms	392 KiB		116 Bytes	2022-4-10 16:28:59
AC	wuzhenghan	14ms	436 KiB		128 Bytes	2022-9-24 19:53:10
AC	炼狱杏寿郎（的粉粉粉粉粉） (sheijiangwohh)	14ms	384 KiB		189 Bytes	2022-3-2 19:49:21
AC	嘉宝 (王淳恺)	14ms	7 MiB	C++98	122 Bytes	2024-6-27 10:16:22
AC	梦之泪伤	14ms	384 KiB		127 Bytes	2022-2-11 22:04:24
AC	zcx	14ms	6.8 MiB		101 Bytes	2023-6-10 11:51:55
AC	lch (凌昌瀚)	14ms	436 KiB		111 Bytes	2022-4-23 9:04:16
AC	张子扬	14ms	512 KiB		182 Bytes	2022-1-22 19:19:45
AC	XYZ303	14ms	448 KiB		131 Bytes	2022-1-19 9:32:42
AC	黄梓桐 (HuangZiTong)	14ms	384 KiB		115 Bytes	2022-9-15 20:01:09
AC	SYC0226	14ms	392 KiB		139 Bytes	2022-1-2 12:45:57
AC	郭益豪（帅哥） (guoyihao)	14ms	6.9 MiB	C++98	141 Bytes	2024-5-21 16:58:56
AC	12345	14ms	392 KiB		125 Bytes	2022-3-12 8:03:01
AC	一个小黑	14ms	6.7 MiB		129 Bytes	2023-9-22 21:16:32
AC	刘鹤枫 (liuhefeng)	14ms	432 KiB		120 Bytes	2022-8-6 14:32:09
AC	wuqilin	14ms	392 KiB		114 Bytes	2023-2-1 18:13:51
AC	罗兰（漆黑襟默) (zhangxiaoci)	14ms	436 KiB		118 Bytes	2022-9-12 13:07:25
AC	冯若涵	14ms	7.1 MiB		97 Bytes	2023-10-21 12:10:23
AC	杜启苇 (duqiwei)	14ms	6.8 MiB		92 Bytes	2023-6-10 15:18:52
AC	时代一校-曾科智 (曾科智)	14ms	416 KiB		115 Bytes	2023-2-25 19:08:18
AC	pandap&a王皓宸 (WANGHAOCHEN)	14ms	512 KiB		111 Bytes	2022-11-20 16:37:53
AC	huangxinyun	14ms	428 KiB		112 Bytes	2022-9-15 17:03:43
AC	wanghuaiying	14ms	7.1 MiB		126 Bytes	2023-10-21 11:54:42
AC	啊...这 (炼狱杏寿郎)	14ms	392 KiB		122 Bytes	2022-9-3 15:43:46
AC	郑淇予 (macabaca)	14ms	392 KiB		112 Bytes	2022-3-27 10:49:47
AC	22029-lyh	14ms	436 KiB		144 Bytes	2023-2-27 20:38:49
AC	明哲瀚 (18580067605)	14ms	384 KiB		118 Bytes	2022-10-3 13:27:19
AC	何星震 (Jacob)	14ms	512 KiB		116 Bytes	2023-1-31 10:55:20
AC	金沙校区-李嘉齐 (李嘉齐)	14ms	7.1 MiB	C++98	113 Bytes	2024-4-24 21:41:46
AC	谭懿轩 (yanyixuan)	14ms	432 KiB		118 Bytes	2022-1-16 16:15:10
AC	傅博涛	14ms	384 KiB		130 Bytes	2022-5-8 11:59:38
AC	cheers 戴 (daizhuorun)	14ms	436 KiB		190 Bytes	2022-3-1 21:27:15
AC	明哲瀚 (18580067605)	14ms	384 KiB		118 Bytes	2022-10-3 13:27:21
AC	蒲梓勋 (puzixun)	14ms	436 KiB		118 Bytes	2022-6-27 22:17:20
AC	xuniaoyin (徐袅音)	14ms	6.9 MiB		105 Bytes	2023-7-11 19:32:12
AC	奇怪的正义人！ (leweiqi)	14ms	432 KiB		152 Bytes	2023-2-17 21:22:24
AC	陈奕瑾 (shenxiulinyue)	14ms	428 KiB		112 Bytes	2022-4-26 21:28:43
AC	yuhaodi	14ms	444 KiB		129 Bytes	2023-4-24 18:48:41
AC	cheers 戴 (daizhuorun)	14ms	444 KiB		166 Bytes	2022-2-21 18:36:30
AC	yxj	14ms	436 KiB		117 Bytes	2022-10-20 14:41:21
AC	任舒尧	14ms	440 KiB		139 Bytes	2023-2-1 9:55:42
AC	qwertyuiop	14ms	384 KiB		121 Bytes	2022-2-18 19:40:40
AC	手搓STL stack 双向无环链表 _ 向量 2种实现方式: template <typename Map_Type> class Stack_l /* Stack _ List / { private: struct Node { Map_Type Node_Data; Node nextp, lastp; Node(void) { nextp = 0; lastp = 0; } }; struct List_Data { unsigned int List_Size; Node headp, endp; List_Data(void) { List_Size = 0; headp = 0; endp = 0; } }Data; struct Vector_Data { Map_Type headp, lastp, endp; void resize(unsigned int data_size) { Map_Type newp = new Map_Type[data_size](); endp = newp + data_size - 1; lastp = newp + (data_size > lastp - headp ? lastp - headp : data_size); if (headp) delete[] headp; headp = newp; } Vector_Data(void) { headp = 0; lastp = 0; endp = 0; } }; public: unsigned int size(void) { return Data.List_Size; } Map_Type& top(void) { return Data.endp -> Node_Data; } void data(void) { return &Data; } bool empty(void) { return !((bool)Data.headp); } Stack_l<Map_Type>& push(Map_Type push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(Map_Type& push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(Map_Type* push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(const Map_Type push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = (Map_Type)push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& pop(void) { if (Data.headp) { if (Data.List_Size == 1u) { delete Data.headp; Data.List_Size = 0; Data.headp = 0; Data.endp = 0; } else { Data.endp = Data.endp -> lastp; delete Data.endp -> nextp; Data.endp -> nextp = 0; --Data.List_Size; } } return this; } Stack_l<Map_Type>& clear(void) { while (Data.List_Size) { pop(); } return this; } Stack_l<Map_Type>(void) { /* NULL / } Stack_l<Map_Type>(unsigned int data_size, Map_Type map_data) { Data.List_Size = data_size; while (data_size--) { Node nodep = new Node(); nodep -> Node_Data = map_data; if (Data.headp) { nodep -> lastp = Data.endp; Data.endp -> nextp = nodep; Data.endp = nodep; } else { Data.headp = nodep; Data.endp = nodep; } } } Stack_l<Map_Type>(Stack_l<Map_Type>& map_data) { if (!map_data.empty()) { List_Data listp = (List_Data)map_data.data(); Node nodep = listp -> headp, newp; for (unsigned int i = 0; i != listp -> List_Size; ++i, nodep = nodep -> nextp) { newp = new Node(); newp -> Node_Data = nodep -> Node_Data; if (Data.headp) { newp -> lastp = Data.endp; Data.endp -> nextp = newp; Data.endp = newp; } else { Data.headp = newp; Data.endp = newp; } } Data.List_Size = listp -> List_Size; } } Stack_l<Map_Type>& operator=(Stack_l<Map_Type>& copy_data) { if (copy_data.empty()) return this; List_Data listp = (List_Data)copy_data.data(); Node nodep = listp -> headp, newp; for (unsigned int i = 0; i != listp -> List_Size; ++i, nodep = nodep -> nextp) { newp = new Node(); newp -> Node_Data = nodep -> Node_Data; if (Data.headp) { newp -> lastp = Data.endp; Data.endp -> nextp = newp; Data.endp = newp; } else { Data.headp = newp; Data.endp = newp; } } Data.List_Size = listp -> List_Size; return this; } bool operator==(Stack_l<Map_Type>& cmp_data) { if (cmp_data.size() != Data.List_Size) return false; else if (cmp_data.empty() && (!Data.List_Size)) return true; Node nodep1 = Data.headp, nodep2 = ((List_Data)cmp_data.data()) ->headp; for (unsigned int i = 0; i != Data.List_Size; ++i, nodep1 = nodep1 -> nextp, nodep2 = nodep2 ->nextp) { if (nodep1 -> Node_Data != nodep2 -> Node_Data) return false; } return true; } bool operator!=(Stack_l<Map_Type>& cmp_data) { if (cmp_data.size() == Data.List_Size) return false; else if (cmp_data.empty() && (!Data.List_Size)) return false; Node nodep1 = Data.headp, nodep2 = ((List_Data)cmp_data.data()) ->headp; for (unsigned int i = 0; i != Data.List_Size; ++i, nodep1 = nodep1 -> nextp, nodep2 = nodep2 ->nextp) { if (nodep1 -> Node_Data != nodep2 -> Node_Data) return true; } return true; } ~Stack_l<Map_Type>(void) { clear(); } }; /* Stack _ List / template <typename Map_Type> class Stack_v / Stack _ Vector / { private: struct Node { Map_Type Node_Data; Node nextp, lastp; Node(void) { nextp = 0; lastp = 0; } }; struct List_Data { unsigned int List_Size; Node headp, endp; List_Data(void) { List_Size = 0; headp = 0; endp = 0; } }; struct Vector_Data { Map_Type headp, lastp, endp; void resize(unsigned int data_size) { Map_Type newp = new Map_Type[data_size](); endp = newp + data_size - 1; lastp = newp + (data_size > lastp - headp ? lastp - headp : data_size); if (headp) delete[] headp; headp = newp; } Vector_Data(void) { headp = 0; lastp = 0; endp = 0; } }Data; public: unsigned int size(void) { return Data.lastp - Data.headp; } Map_Type& top(void) { return (Data.lastp - 1); } void* data(void) { return &Data; } bool full(void) { if (!Data.headp) return true; return Data.endp + 1 == Data.lastp; } bool empty(void) { if (!Data.headp) return true; return Data.headp == Data.lastp; } Stack_v<Map_Type>& push(Map_Type push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(Map_Type& push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(Map_Type* push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(const Map_Type push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = (Map_Type)push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& pop(void) { if (empty()) { if (Data.lastp - Data.headp > 1) Data.resize((Data.lastp - Data.headp) >> 1); else return this; } else --Data.lastp; return this; } Stack_v<Map_Type>(void) { /* NULL / } Stack_v<Map_Type>(unsigned int data_size, Map_Type map_data) { while (data_size) { push(&map_data); --data_size; } } Stack_v<Map_Type>(Stack_v<Map_Type>& map_data) { Vector_Data datap = (Vector_Data)map_data.data(); for (unsigned int i = 0, k = map_data.size(); i != k; ++i) push(datap -> headp + i); } Stack_v<Map_Type>& operator=(Stack_v<Map_Type>& copy_data) { if (copy_data.empty()) clear(); else { Vector_Data datap = (Vector_Data)copy_data.data(); for (unsigned int i = 0, k = copy_data.size(); i != k; ++i) push(datap -> headp + i); } return this; } bool operator==(Stack_v<Map_Type>& cmp_data) { if (size() != cmp_data.size()) return false; else if (empty() && cmp_data.empty()) return true; Vector_Data datap = (Vector_Data)cmp_data.data(); for (unsigned int i = 0, k = size(); i != k; ++i) { if ((Data.headp + i) != (datap ->headp + i)) return false; } return true; } bool operator!=(Stack_v<Map_Type>& cmp_data) { if (size() != cmp_data.size()) return true; else if (empty() && cmp_data.empty()) return false; Vector_Data datap = (Vector_Data)cmp_data.data(); for (unsigned int i = 0, k = size(); i != k; ++i) { if ((Data.headp + i) != (datap -> headp + i)) return true; } return false; } Stack_v<Map_Type>& clear(void) { delete[] Data.headp; Data.headp = 0; Data.lastp = 0; Data.endp = 0; return this; } ~Stack_v<Map_Type>(void) { delete[] Data.headp; } }; / Stack _ Vector */ int main(void) { return 0; } (22029-xys)	14ms	440 KiB		136 Bytes	2023-4-23 20:00:58
AC	陈于硕(我™的) (chenyu)	14ms	6.8 MiB		124 Bytes	2023-6-10 22:05:40
AC	余晨浩 (yuchenhao)	14ms	384 KiB		112 Bytes	2023-5-24 21:22:30
AC	文硕 (文硕1)	14ms	384 KiB		123 Bytes	2022-1-29 21:16:50
AC	陈红恺 (chk)	14ms	388 KiB		112 Bytes	2022-10-10 20:56:53
AC	拥抱幸福小熊(吴沛篪)	14ms	7.1 MiB		121 Bytes	2023-10-21 11:47:43
AC	鲜榨大肠汁	14ms	444 KiB		156 Bytes	2022-3-4 17:29:01
AC	444444444 (唐跃元)	14ms	6.7 MiB		115 Bytes	2023-8-29 14:16:48
AC	LDE__113 (逯典恩)	14ms	512 KiB		95 Bytes	2022-8-28 18:15:20
AC	肖添宇	14ms	436 KiB		144 Bytes	2022-3-19 17:45:54
AC	明哲瀚 (18580067605)	14ms	384 KiB		118 Bytes	2022-10-3 13:27:22
AC	tsc_ (杨悦堃)	14ms	444 KiB		125 Bytes	2023-3-4 16:38:02
AC	姚宏逸	14ms	384 KiB		108 Bytes	2022-2-25 19:17:55
AC	陈杰晟	14ms	436 KiB		125 Bytes	2022-2-17 15:29:55
AC	杜俊宏	14ms	432 KiB		127 Bytes	2022-3-23 21:06:35
AC	伍芷函	14ms	448 KiB		147 Bytes	2023-5-7 8:58:15
AC	暗蛆突围 (lzh)	14ms	7.5 MiB	C++98	136 Bytes	2024-5-18 15:41:42
AC	_daa	14ms	512 KiB		119 Bytes	2022-3-5 11:14:50
AC	wzzjnb2012	14ms	512 KiB		120 Bytes	2022-9-21 16:34:54
AC	刘政君 (lzj)	14ms	516 KiB		122 Bytes	2022-7-6 9:18:02
AC	南坪校区-邵冠铖 (邵冠铖)	14ms	6.8 MiB		115 Bytes	2023-10-26 22:20:24
AC	旷山 (15213268688)	14ms	392 KiB		366 Bytes	2022-2-11 16:42:58
AC	章愉霖	14ms	444 KiB		136 Bytes	2023-5-14 17:59:19
AC	付博plus	14ms	432 KiB		131 Bytes	2022-9-2 14:54:52
AC	黄立信	14ms	6.8 MiB		116 Bytes	2023-10-6 18:01:06
AC	x0l0x	14ms	6.8 MiB		117 Bytes	2023-10-9 16:58:24
AC	时代一校-段老师：李云舒 (李云舒)	14ms	6.7 MiB		131 Bytes	2023-9-17 17:56:28
AC	hnd (陈皓洋)	14ms	392 KiB		267 Bytes	2022-9-3 17:05:12
AC	wangjun	14ms	6.8 MiB		145 Bytes	2023-11-7 18:10:43
AC	邵冠铖 (shaoguancheng22031)	14ms	6.8 MiB		115 Bytes	2023-10-26 22:20:36
AC	杨洋	14ms	7.2 MiB	C++98	116 Bytes	2024-4-21 14:20:59
AC	经常消失 (小萝卜)	14ms	408 KiB		125 Bytes	2022-3-24 21:28:28
AC	新壹街陈科言 (cky)	14ms	7 MiB		103 Bytes	2023-7-18 15:44:22
AC	UsMt1 (jiangyuan)	14ms	6.9 MiB		1.1 KiB	2023-7-26 22:19:47
AC	王康瑞	14ms	6.9 MiB		137 Bytes	2023-10-21 11:45:29
AC	SHY20091224	14ms	436 KiB		116 Bytes	2022-8-21 15:06:04
AC	river	14ms	384 KiB		140 Bytes	2022-10-9 14:29:10
AC	陈秋石	14ms	384 KiB		114 Bytes	2022-8-22 15:21:31
AC	AC[谭赫奕] (tanheyi)	14ms	6.7 MiB		136 Bytes	2023-9-20 20:21:10
AC	曹雅萱	14ms	7 MiB	C++11	140 Bytes	2024-8-25 11:50:56
AC	(张洛诚)	14ms	448 KiB		129 Bytes	2023-4-20 20:38:22
AC	源著校区-宋昊成 (马冬梅)	14ms	440 KiB		129 Bytes	2023-2-25 16:55:11
AC	学神降临 (陈柯玮)	14ms	6.7 MiB		154 Bytes	2023-9-20 11:04:05
AC	繁星 (05c35-zzm)	14ms	384 KiB		125 Bytes	2022-10-29 15:37:10