整数的四则运算

状态	递交者	时间	内存	语言	代码	递交时间
AC	食不食油饼（点主页康康） (Nemo)	7ms	384 KiB		244 Bytes	2022-8-26 14:26:36
AC	谢延灏 (xeiyanhao---a handsome boy)	7ms	384 KiB		247 Bytes	2022-1-17 21:20:29
AC	老六（王牌） (mhc)	7ms	412 KiB		291 Bytes	2023-4-30 14:54:19
AC	yuhaodi	7ms	400 KiB		240 Bytes	2021-12-30 19:01:30
AC	刘蕤箎	7ms	384 KiB		245 Bytes	2023-3-13 21:50:49
AC	陈薪字	7ms	384 KiB		265 Bytes	2022-6-12 12:01:55
AC	wuqilin	7ms	432 KiB		312 Bytes	2022-9-17 16:48:41
AC	邹镇宇zzy	7ms	6.8 MiB		260 Bytes	2023-10-21 13:54:06
AC	lhy	7ms	436 KiB		285 Bytes	2023-2-10 18:50:23
AC	明轩 (吕同学)	7ms	440 KiB		244 Bytes	2022-8-3 21:11:43
AC	余多多29	7ms	400 KiB		256 Bytes	2023-4-25 20:50:57
AC	呵呵呵 (陈思琦)	7ms	384 KiB		234 Bytes	2022-9-3 16:49:02
AC	罗兰（漆黑襟默) (zhangxiaoci)	7ms	384 KiB		255 Bytes	2022-8-22 17:16:11
AC	chen (peter)	7ms	384 KiB		268 Bytes	2022-3-13 16:01:08
AC	陈欣楠 (chenxinnan)	7ms	384 KiB		252 Bytes	2022-7-20 15:20:11
AC	qyj	7ms	404 KiB		238 Bytes	2022-2-26 11:50:35
AC	代尚函笛卡尔 (daishanghan)	7ms	436 KiB		239 Bytes	2022-8-22 15:20:32
AC	白祖睿	7ms	6.6 MiB	C++98(O2)	252 Bytes	2024-7-8 15:08:09
AC	王涵熙 (水煮大肠)	7ms	444 KiB		246 Bytes	2022-6-9 20:30:37
AC	MacrozClick_ (蒋淞霖)	7ms	384 KiB		276 Bytes	2022-1-22 9:59:12
AC	关博源	7ms	384 KiB		308 Bytes	2023-2-18 10:14:23
AC	chenruoxi	7ms	6.7 MiB	C++98	229 Bytes	2024-7-11 12:26:44
AC	05c05-zzx	7ms	384 KiB		245 Bytes	2022-6-5 15:40:33
AC	陈雨泽1	7ms	392 KiB		227 Bytes	2023-6-3 11:24:21
AC	chenyifei	7ms	392 KiB		263 Bytes	2022-1-21 20:21:51
AC	方子谦 (方子谦00)	7ms	384 KiB		255 Bytes	2022-3-13 11:19:17
AC	新壹街校区-罗斤天 (罗斤天)	7ms	512 KiB		248 Bytes	2022-4-4 14:49:10
AC	李昀铂	7ms	384 KiB		245 Bytes	2022-2-19 9:35:35
AC	余晨浩 (yuchenhao)	7ms	384 KiB		228 Bytes	2022-8-24 15:13:18
AC	魏楚浔 (shawn)	7ms	384 KiB		232 Bytes	2022-2-27 18:12:21
AC	贾璨玮 (马NB)	7ms	392 KiB		254 Bytes	2022-7-18 19:35:52
AC	huangxinyun	7ms	384 KiB		275 Bytes	2022-2-26 21:29:27
AC	Ronnie	7ms	392 KiB		273 Bytes	2022-3-6 9:21:46
AC	新壹街校区-杨轩懿 (杨轩懿1)	7ms	6.7 MiB		234 Bytes	2023-9-26 21:40:08
AC	陈骏洋	7ms	384 KiB		284 Bytes	2022-1-22 10:02:23
AC	dengfeng	7ms	384 KiB		322 Bytes	2022-2-10 14:05:33
AC	帅哥张涵曦	7ms	384 KiB		238 Bytes	2022-1-23 15:16:45
AC	罗晨睿 (luochenrui)	7ms	384 KiB		247 Bytes	2022-6-26 13:22:20
AC	陌生人 (涂玉龙)	7ms	7 MiB	C++11	242 Bytes	2024-6-9 12:48:26
AC	12345	7ms	384 KiB		269 Bytes	2022-3-9 19:55:22
AC	新壹街校区-陈品烨 (陈品烨)	7ms	6.7 MiB		249 Bytes	2023-10-1 11:22:48
AC	江科毅 (jky)	7ms	384 KiB		293 Bytes	2023-5-24 18:51:48
AC	wky	7ms	392 KiB		264 Bytes	2022-6-12 17:36:47
AC	礼貌塞班	7ms	444 KiB		275 Bytes	2023-1-31 17:58:28
AC	杨睎尧	7ms	436 KiB		309 Bytes	2022-1-25 11:13:10
AC	05c05-scl	7ms	392 KiB		288 Bytes	2022-6-5 15:43:14
AC	huyinuo	7ms	384 KiB		312 Bytes	2022-3-13 21:17:41
AC	国林泽 (guolinze)	7ms	440 KiB		305 Bytes	2022-2-18 21:40:38
AC	x0l0x	7ms	6.7 MiB		251 Bytes	2023-10-1 8:33:56
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		321 Bytes	2023-4-23 18:38:14
AC	余彦瑞	7ms	412 KiB		233 Bytes	2022-8-23 10:19:42
AC	刘煜轩	7ms	440 KiB		295 Bytes	2023-4-9 14:38:59
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	7ms	392 KiB		269 Bytes	2022-3-26 15:42:33
AC	谢延灏 (xeiyanhao---a handsome boy)	7ms	384 KiB		249 Bytes	2022-3-13 11:37:52
AC	ttt123	7ms	6.9 MiB		283 Bytes	2023-7-8 17:55:05
AC	05c05-yyc	7ms	384 KiB		244 Bytes	2022-3-22 20:15:06
AC	老六（王牌） (mhc)	7ms	384 KiB		302 Bytes	2023-3-23 19:41:19
AC	05c35-szy	7ms	444 KiB		267 Bytes	2022-3-13 8:53:13
AC	神印王座	7ms	440 KiB		281 Bytes	2022-9-24 16:16:09
AC	褚博艺	7ms	6.7 MiB		219 Bytes	2023-9-20 22:29:58
AC	邹曜丞 (13983097018)	7ms	384 KiB		281 Bytes	2023-3-19 10:54:53
AC	luosifu22006	7ms	432 KiB		249 Bytes	2022-7-3 21:32:38
AC	拥抱幸福小熊(吴沛篪)	7ms	6.8 MiB		244 Bytes	2023-10-15 11:58:28
AC	MacrozClick_ (蒋淞霖)	7ms	512 KiB		276 Bytes	2022-1-22 9:59:10
AC	黄誉翔 (黄誉翔)	7ms	384 KiB		266 Bytes	2022-4-16 16:31:38
AC	庹仕杰	7ms	384 KiB		252 Bytes	2022-11-12 17:10:18
AC	你爹 (郭铠嘉)	7ms	384 KiB		262 Bytes	2022-1-25 20:10:54
AC	关博源	7ms	392 KiB		308 Bytes	2023-2-18 10:14:23
AC	马渝杭 (mayuhang)	7ms	436 KiB		247 Bytes	2022-4-28 21:54:49
AC	CK (李弘毅)	7ms	392 KiB		266 Bytes	2022-7-2 11:04:25
AC	杨紫妍	7ms	440 KiB		264 Bytes	2022-7-10 11:43:57
AC	唐嘉文	7ms	412 KiB		259 Bytes	2022-9-17 14:08:35
AC	CYT	7ms	440 KiB		237 Bytes	2022-12-1 20:22:24
AC	源著校区-宋昊成 (马冬梅)	7ms	424 KiB		309 Bytes	2023-2-3 17:32:58
AC	周米骐 (zsb)	7ms	6.8 MiB		255 Bytes	2023-10-12 18:25:45
AC	谢思睿	7ms	6.7 MiB		249 Bytes	2023-8-31 15:39:37
AC	zyb小号	7ms	6.7 MiB		243 Bytes	2023-9-10 20:19:25
AC	何中蓉	7ms	7.2 MiB	C++11	250 Bytes	2024-4-22 21:04:59
AC	明轩 (吕同学)	7ms	384 KiB		234 Bytes	2022-8-26 14:29:17
AC	MoonLight ( aaa)	7ms	384 KiB		257 Bytes	2022-1-1 9:07:16
AC	陈骏洋	7ms	384 KiB		284 Bytes	2022-1-22 10:02:12
AC	我全家SB！！！我没母！！！ (baijinlin)	7ms	392 KiB		260 Bytes	2023-3-11 17:28:52
AC	俞伏羲	7ms	7 MiB	C++98(O2)	234 Bytes	2024-6-22 11:04:03
AC	Error404sans (焦阳浩云)	7ms	6.8 MiB	C++20(O2)	507 Bytes	2024-5-20 20:53:21
AC	何星震 (Jacob)	7ms	428 KiB		235 Bytes	2023-2-20 11:03:13
AC	杨军方 (lyx2000)	7ms	384 KiB		291 Bytes	2022-3-6 9:35:19
AC	在线销售纯洁晟！！！	7ms	432 KiB		315 Bytes	2022-6-30 13:41:51
AC	Eastwa	7ms	6.8 MiB	C++98(O2)	236 Bytes	2024-8-11 16:07:55
AC	关博源	7ms	512 KiB		308 Bytes	2023-2-18 10:14:21
AC	董博煜	7ms	384 KiB		249 Bytes	2022-8-24 21:55:27
AC	关博源	7ms	392 KiB		308 Bytes	2023-2-18 10:14:22
AC	凌肯 (lingken22006)	7ms	392 KiB		266 Bytes	2022-3-21 19:29:29
AC	05c41-hzs	7ms	444 KiB		279 Bytes	2022-3-10 18:37:54
AC	朱泽晟	7ms	384 KiB		302 Bytes	2022-1-1 19:26:21
AC	wuqi	7ms	384 KiB		299 Bytes	2022-1-22 9:54:48
AC	wuqi	7ms	384 KiB		299 Bytes	2022-1-22 10:03:46
AC	马牛逼 (05C41-ljy)	7ms	384 KiB		240 Bytes	2022-2-12 15:21:55
AC	zjl	7ms	384 KiB		300 Bytes	2023-5-14 14:09:45
AC	宋金龙 (songjl0421)	7ms	392 KiB		245 Bytes	2022-1-22 12:07:21
AC	谢靳骁 (XJX)	7ms	436 KiB		285 Bytes	2023-5-19 17:32:14