四则运算

状态	递交者	时间	内存	语言	代码	递交时间
AC	AAA? Prow max (hechenxuan23005)	7ms	7 MiB	C++98	233 Bytes	2024-6-8 20:09:39
AC	苏庭毅	7ms	384 KiB		224 Bytes	2023-3-30 18:42:18
AC	longhao	7ms	392 KiB		282 Bytes	2022-1-23 17:57:21
AC	星野光 (Hoshino Hikari)	7ms	6.9 MiB		388 Bytes	2023-10-20 19:43:07
AC	SMIK	7ms	392 KiB		239 Bytes	2022-1-24 12:27:41
AC	无尽的想象 (谭仕高)	7ms	384 KiB		264 Bytes	2022-12-31 15:50:10
AC	wangzhijie	7ms	384 KiB		367 Bytes	2022-2-12 14:08:40
AC	dengduxi	7ms	384 KiB		336 Bytes	2022-11-27 11:41:49
AC	赵彬鸿	7ms	444 KiB		196 Bytes	2022-8-12 15:14:14
AC	张泰凌 (ztl)	7ms	384 KiB		315 Bytes	2022-3-18 19:30:00
AC	赵彬鸿	7ms	388 KiB		196 Bytes	2022-8-12 15:14:21
AC	22029-lsl	7ms	384 KiB		224 Bytes	2022-12-3 9:38:21
AC	tsc_ (杨悦堃)	7ms	384 KiB		284 Bytes	2023-3-15 13:14:10
AC	zzl	7ms	6.9 MiB		211 Bytes	2023-7-27 13:46:14
AC	ttz	7ms	440 KiB		281 Bytes	2022-3-13 9:34:48
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)	7ms	384 KiB		266 Bytes	2022-12-3 9:27:49
AC	0721 (龙浩恩)	7ms	6.9 MiB		208 Bytes	2023-10-28 17:15:02
AC	黄立信	7ms	6.8 MiB		326 Bytes	2023-10-6 18:01:44
AC	付博plus	7ms	428 KiB		210 Bytes	2023-2-15 19:40:40
AC	yuhaodi	7ms	384 KiB		257 Bytes	2023-4-23 16:17:17
AC	赵彬鸿	7ms	384 KiB		196 Bytes	2022-8-12 15:14:23
AC	Ronnie	7ms	432 KiB		255 Bytes	2022-2-11 15:32:49
AC	周莀熙	7ms	6.9 MiB	C++11	266 Bytes	2024-8-21 17:58:24
AC	啊...这 (炼狱杏寿郎)	7ms	512 KiB		324 Bytes	2022-8-14 14:23:16
AC	赵泳鑫 (zhaoyongxin)	7ms	384 KiB		260 Bytes	2022-3-13 9:43:27
AC	炸鱼4000+ (dxc)	7ms	7.1 MiB	C++14(O2)	199 Bytes	2024-5-8 21:35:51
AC	Cristiano·Ronaldo (05c41-gmz)	7ms	440 KiB		209 Bytes	2022-7-26 16:49:59
AC	黄立信	7ms	6.8 MiB		326 Bytes	2023-10-6 8:04:08
AC	林小博	7ms	456 KiB		320 Bytes	2022-7-1 10:33:55
AC	童艺涵	7ms	428 KiB		230 Bytes	2022-12-7 20:48:15
AC	AAA? Prow max (hechenxuan23005)	7ms	7 MiB	C++98	233 Bytes	2024-6-8 16:57:09
AC	徐子恩 (Cow)	7ms	424 KiB		237 Bytes	2022-3-10 20:03:27
AC	言年想摆烂~	7ms	512 KiB		275 Bytes	2023-2-27 22:30:15
AC	三藏的痔疮 (不会玩是原罪)	7ms	384 KiB		356 Bytes	2022-1-21 11:54:20
AC	冒牌陈杰晟【MOD】 (wed)	7ms	440 KiB		293 Bytes	2022-2-26 11:58:36
AC	李禹衡 (liyuheng22006)	7ms	420 KiB		236 Bytes	2022-6-5 19:37:13
AC	hangge	7ms	512 KiB		336 Bytes	2023-5-29 19:02:59
AC	陈玺宇	7ms	6.8 MiB		334 Bytes	2023-9-24 13:41:41
AC	赵彬鸿	7ms	384 KiB		196 Bytes	2022-8-12 15:14:19
AC	zhangyh (张育菡)	7ms	384 KiB		273 Bytes	2022-5-15 10:01:25
AC	张祖名	7ms	7 MiB	C++98(O2)	237 Bytes	2024-6-2 16:35:02
AC	yanxiaosong	7ms	436 KiB		315 Bytes	2022-9-12 11:57:29
AC	牟淳雅	7ms	6.7 MiB		299 Bytes	2023-9-17 19:38:38
AC	22029-lyh	7ms	512 KiB		336 Bytes	2022-11-19 15:56:01
AC	暗蛆突围 (lzh)	7ms	6.8 MiB		346 Bytes	2023-10-29 0:08:08
AC	德克萨斯做的到吗 (liyangbao)	7ms	384 KiB		412 Bytes	2022-10-30 1:26:13
AC	Error404sans (焦阳浩云)	7ms	6.9 MiB	C++20(O2)	4.5 KiB	2024-8-18 17:21:09
AC	miku (阳沐珊)	7ms	6.7 MiB		281 Bytes	2023-9-10 15:44:12
AC	wuzhenghan	7ms	392 KiB		324 Bytes	2022-10-19 21:18:35
AC	赵彬鸿	7ms	392 KiB		196 Bytes	2022-8-12 15:14:24
AC	徐梓尧 (xuziyao001)	7ms	444 KiB		224 Bytes	2022-9-10 21:26:43
AC	新壹街校区-杨轩懿 (杨轩懿1)	7ms	392 KiB		257 Bytes	2023-4-1 19:33:49
AC	贾博涵	7ms	6.8 MiB		205 Bytes	2023-11-1 12:18:43
AC	Aphrode	7ms	6.8 MiB		299 Bytes	2023-6-23 13:22:32
AC	蓝色妖姬 (jiangpeiyu)	7ms	384 KiB		336 Bytes	2022-11-7 10:08:53
AC	史韵哲	7ms	440 KiB		251 Bytes	2023-2-28 19:36:13
AC	赵彬鸿	7ms	384 KiB		196 Bytes	2022-8-12 15:14:16
AC	LukeDid	7ms	436 KiB		321 Bytes	2023-4-22 18:51:23
AC	cheers 戴 (daizhuorun)	7ms	440 KiB		363 Bytes	2022-9-3 18:59:04
AC	新壹街——陈学彬 (BUG)	7ms	7.1 MiB		209 Bytes	2023-7-9 11:01:45
AC	时代一校蒋帛希 (13983392730)	7ms	6.9 MiB		201 Bytes	2023-7-9 13:49:47
AC	新壹街校区-陈峻熙 (陈峻熙)	7ms	7.3 MiB		280 Bytes	2023-10-28 11:29:55
AC	huanglu	7ms	6.9 MiB		213 Bytes	2023-7-15 13:44:55
AC	源著校区-宋昊成 (马冬梅)	7ms	436 KiB		280 Bytes	2023-2-25 17:03:07
AC	yuchenyi23017	7ms	6.7 MiB		268 Bytes	2023-9-17 19:14:13
AC	yanglang	7ms	384 KiB		223 Bytes	2022-10-16 12:14:08
AC	刘鹤枫 (liuhefeng)	7ms	384 KiB		256 Bytes	2022-8-7 13:38:48
AC	陈骏逸 (chenjunyi)	7ms	384 KiB		241 Bytes	2022-11-13 11:42:58
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	7ms	384 KiB		270 Bytes	2022-6-5 15:51:09
AC	dengduxi	7ms	384 KiB		332 Bytes	2022-11-27 11:42:18
AC	UsMt1 (jiangyuan)	7ms	6.7 MiB		219 Bytes	2023-9-13 22:09:18
AC	22029-zjs	7ms	384 KiB		233 Bytes	2022-12-3 9:36:00
AC	一片落叶 (yeyuhao)	7ms	6.7 MiB		320 Bytes	2023-8-24 14:53:01
AC	叶哲宇 (yzy)	7ms	6.9 MiB		219 Bytes	2023-8-20 16:53:10
AC	廖永亨	7ms	384 KiB		245 Bytes	2022-11-24 18:52:04
AC	赵彬鸿	7ms	384 KiB		196 Bytes	2022-8-12 15:14:22
AC	朱老师 (zyp)	7ms	440 KiB		206 Bytes	2022-7-25 17:00:03
AC	wzzjnb2012	7ms	428 KiB		282 Bytes	2022-9-23 16:47:27
AC	新壹街校区-陈琬舒 (空空大师)	7ms	6.9 MiB		229 Bytes	2023-7-31 11:12:54
AC	偽艺術家 (chenyanchi22006)	7ms	512 KiB		241 Bytes	2022-8-20 15:30:28
AC	heyuzhe	7ms	7.1 MiB	C++98	221 Bytes	2024-6-16 15:52:39
AC	小忙果 (王昱杰)	7ms	384 KiB		229 Bytes	2023-3-18 18:30:18
AC	三差学生 (尘埃蓝莓)	7ms	6.9 MiB		251 Bytes	2023-7-8 11:50:03
AC	吴卓轩	7ms	444 KiB		395 Bytes	2022-9-18 14:46:51
AC	CK (李弘毅)	7ms	6.8 MiB		254 Bytes	2023-10-22 10:32:09
AC	LDE__113 (逯典恩)	7ms	512 KiB		302 Bytes	2022-8-28 18:18:23
AC	希蒙 (zhengxingya)	7ms	6.9 MiB		232 Bytes	2023-7-24 19:43:19
AC	李树崑 (lishukun)	7ms	412 KiB		366 Bytes	2022-11-5 12:36:31
AC	JOKER (hhy)	7ms	6.9 MiB		249 Bytes	2023-7-17 18:21:24
AC	金沙校区-蓝祥与 (蓝祥与)	7ms	512 KiB		246 Bytes	2022-9-28 20:01:35
AC	黄梓桐 (HuangZiTong)	7ms	428 KiB		222 Bytes	2022-10-13 21:22:29
AC	zhangyouze (张佑泽)	8ms	6.8 MiB		268 Bytes	2023-10-21 17:14:06
AC	not_None	8ms	412 KiB		227 Bytes	2022-1-27 17:30:25
AC	爱琴海校区-黄辰浩 (huangchenhao)	8ms	6.7 MiB		332 Bytes	2023-8-31 15:42:01
AC	周琪渃	8ms	432 KiB		391 Bytes	2022-12-9 20:50:33
AC	坤坤荔枝小黑子 (zhonghaotian22006)	8ms	440 KiB		338 Bytes	2022-9-6 20:35:38
AC	金沙校区-先珂熠 (九转大肠)	8ms	6.9 MiB	C++20(O2)	249 Bytes	2024-8-17 19:50:48
AC	罗竣瀚	8ms	416 KiB		294 Bytes	2022-10-15 19:17:06
AC	yixingyou	8ms	512 KiB		320 Bytes	2022-9-17 9:29:12
AC	10255	8ms	6.8 MiB		216 Bytes	2023-10-18 19:14:44