简单的计算器

状态	递交者	时间	内存	语言	代码	递交时间
AC	杨淇瑞 (杨淇瑞29)	13ms	6.9 MiB	C++98	520 Bytes	2024-5-20 19:32:00
AC	陈骏逸 (chenjunyi)	13ms	392 KiB		394 Bytes	2022-7-25 9:44:34
AC	MoonLight ( aaa)	13ms	392 KiB		440 Bytes	2022-1-1 10:02:43
AC	Accepted (周芷乐)	13ms	7 MiB	C++14	425 Bytes	2024-6-17 21:14:08
AC	RanHao	13ms	6.9 MiB		485 Bytes	2023-10-29 14:40:42
AC	longhao	13ms	392 KiB		353 Bytes	2022-1-26 9:15:25
AC	(张洛诚)	13ms	396 KiB		502 Bytes	2023-4-3 21:06:51
AC	zvt_132 (任子轩)	13ms	6.5 MiB	C++98	372 Bytes	2024-7-26 11:14:42
AC	Accepted (周芷乐)	13ms	7 MiB	C++14	425 Bytes	2024-6-17 21:49:13
AC	陈海骞 (chq)	13ms	412 KiB		445 Bytes	2022-5-28 9:55:57
AC	樊竣熠 (lft1114)	13ms	384 KiB		507 Bytes	2022-1-24 16:04:34
AC	程子杰 (05c41-czj)	13ms	444 KiB		420 Bytes	2022-7-27 11:31:09
AC	王宇桐 (我是外挂)	13ms	512 KiB		403 Bytes	2022-1-26 14:16:10
AC	SYC0226	13ms	384 KiB		393 Bytes	2022-3-13 13:09:38
AC	fsx	13ms	6.9 MiB	C++11(O2)	311 Bytes	2024-8-23 15:09:23
AC	杜俊宏	13ms	384 KiB		347 Bytes	2022-3-15 21:59:03
AC	新壹街校区-杨轩懿 (杨轩懿1)	13ms	6.7 MiB		344 Bytes	2023-9-26 21:31:14
AC	Jack	13ms	440 KiB		384 Bytes	2022-8-2 17:14:11
AC	杨在云 (yangzaiyun001)	13ms	436 KiB		321 Bytes	2022-9-12 19:17:01
AC	xxteacher	13ms	384 KiB		463 Bytes	2022-1-26 16:04:10
AC	陈年保宁醋 (dengboren)	13ms	392 KiB		666 Bytes	2022-1-22 20:31:40
AC	hulang	13ms	384 KiB		473 Bytes	2022-4-16 20:11:13
AC	Z.饮月君 (张皓南)	13ms	436 KiB		627 Bytes	2022-3-16 22:27:58
AC	坤坤荔枝小黑子 (zhonghaotian22006)	13ms	384 KiB		421 Bytes	2022-9-11 17:00:25
AC	灿灿 (CAN)	13ms	384 KiB		469 Bytes	2022-6-2 17:29:35
AC	明轩 (吕同学)	13ms	7.1 MiB		385 Bytes	2024-1-22 11:09:01
AC	刘思齐	13ms	7 MiB	C++98	482 Bytes	2024-6-26 18:17:46
AC	zhangyh (张育菡)	13ms	436 KiB		346 Bytes	2022-6-10 22:20:54
AC	张卜 (张卜01)	13ms	384 KiB		1.4 KiB	2022-7-25 19:44:42
AC	GYZ	13ms	432 KiB		712 Bytes	2022-4-20 18:30:17
AC	赵鑫宸 (xiaoxiao721)	13ms	512 KiB		463 Bytes	2022-2-20 3:07:18
AC	无尽的想象 (谭仕高)	13ms	512 KiB		369 Bytes	2022-7-12 18:15:49
AC	新壹街朱启航 (zhuqihang)	13ms	6.6 MiB	C++98	395 Bytes	2024-7-7 15:25:34
AC	CMG	13ms	424 KiB		419 Bytes	2022-6-6 21:27:19
AC	Guest	13ms	7 MiB	C++98(O2)	394 Bytes	2024-8-24 13:28:52
AC	汪致卉 (wangzh)	13ms	392 KiB		615 Bytes	2022-1-22 18:57:08
AC	曾御城（现用名） (Jason)	13ms	392 KiB		434 Bytes	2022-1-23 16:32:22
AC	没有此人 (akm)	13ms	384 KiB		377 Bytes	2022-10-1 18:40:31
AC	张峻熙	13ms	512 KiB		418 Bytes	2022-9-18 10:25:37
AC	1396013295	13ms	512 KiB		595 Bytes	2022-1-21 20:59:27
AC	时代校区-孔令皓 (konglinghao)	13ms	384 KiB		343 Bytes	2023-4-16 10:57:02
AC	吴俊成 (wujuncheng)	13ms	512 KiB		493 Bytes	2022-7-8 23:17:06
AC	唐彬献	13ms	7.4 MiB		408 Bytes	2023-10-28 10:53:13
AC	时代一校 - 冯隆浩 (冯隆浩)	13ms	420 KiB		321 Bytes	2022-7-2 18:34:44
AC	罗元邑2	14ms	6.7 MiB	C++98(O2)	624 Bytes	2024-7-14 13:10:52
AC	林小博	14ms	384 KiB		577 Bytes	2022-4-30 10:48:24
AC	王康瑞	14ms	6.9 MiB		398 Bytes	2023-10-28 10:43:25
AC	宋坤霖	14ms	7 MiB	C++11	354 Bytes	2024-6-8 13:15:31
AC	lch (凌昌瀚)	14ms	432 KiB		348 Bytes	2022-4-23 9:39:58
AC	火爆肥肠（杨弘毅） (火爆肥肠)	14ms	384 KiB		459 Bytes	2022-2-28 21:16:40
AC	黄梓桐 (HuangZiTong)	14ms	512 KiB		301 Bytes	2023-4-30 12:02:33
AC	12345	14ms	432 KiB		450 Bytes	2022-3-24 20:25:18
AC	魑归sama	14ms	440 KiB		367 Bytes	2022-7-12 16:07:00
AC	时代一校林星宇 (lxy)	14ms	436 KiB		372 Bytes	2023-4-23 22:27:34
AC	冒牌陈杰晟【MOD】 (wed)	14ms	512 KiB		483 Bytes	2022-2-24 18:45:10
AC	陈秋石	14ms	436 KiB		374 Bytes	2022-3-15 21:47:13
AC	22029-lyh	14ms	384 KiB		395 Bytes	2022-10-2 18:52:49
AC	执剑人罗辑 (Jasson)	14ms	6.8 MiB		335 Bytes	2023-6-10 13:57:44
AC	吃小孩的viv_	14ms	512 KiB		407 Bytes	2022-7-31 15:22:39
AC	kkksc03 (彭士锋)	14ms	512 KiB		368 Bytes	2022-3-5 14:52:15
AC	黄立信	14ms	6.8 MiB		382 Bytes	2023-10-10 22:03:51
AC	罗晨睿 (luochenrui)	14ms	392 KiB		410 Bytes	2022-6-26 16:14:19
AC	呵呵呵 (陈思琦)	14ms	392 KiB		328 Bytes	2022-9-3 17:34:51
AC	BJ6180C8CTD (Fan)	14ms	6.7 MiB		467 Bytes	2023-9-16 14:06:53
AC	chenyifei	14ms	432 KiB		466 Bytes	2022-4-16 19:57:24
AC	极为的好van的 (lyq)	14ms	424 KiB		333 Bytes	2022-9-12 11:22:27
AC	许嘉恩 (xje22031)	14ms	384 KiB		522 Bytes	2022-11-25 18:44:44
AC	赵泳鑫 (zhaoyongxin)	14ms	444 KiB		471 Bytes	2022-4-23 17:52:18
AC	郑妍汐	14ms	512 KiB		441 Bytes	2022-2-18 23:02:06
AC	张梓辰 (DiaoDesi屌德斯)	14ms	428 KiB		385 Bytes	2022-9-13 21:28:24
AC	霍弈丞	14ms	384 KiB		436 Bytes	2022-3-17 18:04:02
AC	爱琴海校区-黄辰浩 (huangchenhao)	14ms	6.7 MiB		327 Bytes	2023-9-27 20:45:13
AC	言年想摆烂~	14ms	6.8 MiB		356 Bytes	2023-6-10 21:12:32
AC	(金沙天街)严皓月 (严皓月)	14ms	7 MiB		519 Bytes	2024-1-11 19:46:57
AC	秦子越 (13883322087)	14ms	384 KiB		479 Bytes	2022-2-8 18:04:33
AC	在煎鱼的肖大总铳 (肖宇航)	14ms	7 MiB		348 Bytes	2023-9-24 10:49:32
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	428 KiB		478 Bytes	2022-11-20 17:42:13
AC	ttt123	14ms	512 KiB		448 Bytes	2022-11-20 17:31:54
AC	GYZ	14ms	436 KiB		712 Bytes	2022-3-13 19:36:53
AC	芒苒忧 (廖迦南)	14ms	384 KiB		410 Bytes	2022-1-25 14:53:32
AC	杨淇瑞 (杨淇瑞29)	14ms	6.8 MiB		521 Bytes	2023-9-29 15:23:09
AC	张瑞博	14ms	7.2 MiB	C++11	389 Bytes	2024-4-23 22:05:39
AC	李某人	14ms	384 KiB		457 Bytes	2022-1-25 18:00:25
AC	陈杰晟	14ms	512 KiB		396 Bytes	2022-2-18 13:39:21
AC	田世瑞	14ms	384 KiB		419 Bytes	2023-3-15 20:00:23
AC	许炜铭 (xuweiming)	14ms	384 KiB		393 Bytes	2023-4-17 21:29:00
AC	刘沄熙	14ms	436 KiB		557 Bytes	2022-3-13 11:59:03
AC	许徐非凡 (非同凡响)	14ms	7.1 MiB	C++98	369 Bytes	2024-6-14 19:39:14
AC	xiangsiyu	14ms	440 KiB		311 Bytes	2022-7-28 20:54:22
AC	shenyushun2	14ms	392 KiB		391 Bytes	2022-11-30 22:22:01
AC	huyinuo	14ms	384 KiB		421 Bytes	2022-2-28 20:08:37
AC	张子扬	14ms	436 KiB		494 Bytes	2022-3-1 21:42:22
AC	周琪渃	14ms	384 KiB		484 Bytes	2023-2-11 19:08:48
AC	许炜铭 (xuweiming)	14ms	6.8 MiB		451 Bytes	2023-6-10 14:14:27
AC	谢润轩	14ms	6.7 MiB		519 Bytes	2023-9-22 20:03:25
AC	李歆颜 (llxy)	14ms	6.9 MiB		418 Bytes	2023-8-4 17:22:12
AC	王祎辰 (wangyichen)	14ms	7 MiB		355 Bytes	2023-7-16 14:49:49
AC	heyi	14ms	6.8 MiB	C++98(O2)	337 Bytes	2024-8-8 18:45:43
AC	崔欧辰	14ms	6.8 MiB	C++11	547 Bytes	2024-8-9 21:20:33
AC	源著校区陈锐霖 (13983855850)	14ms	6.7 MiB		307 Bytes	2023-9-15 20:04:12