数字组合

状态	递交者	时间	内存	语言	代码	递交时间
AC	zzl	7ms	6.9 MiB		451 Bytes	2023-7-27 11:49:54
AC	郑尧 (zhengyao)	7ms	6.7 MiB		500 Bytes	2023-8-26 18:46:52
AC	我很6 (zjj22031)	7ms	384 KiB		496 Bytes	2023-3-12 11:00:38
AC	金沙校区-先珂熠 (九转大肠)	7ms	6.9 MiB	C++20(O2)	474 Bytes	2024-8-17 19:49:15
AC	德克萨斯做的到吗 (liyangbao)	7ms	384 KiB		586 Bytes	2022-10-31 16:45:53
AC	yzl	7ms	436 KiB		463 Bytes	2022-4-9 19:58:31
AC	qwq	7ms	436 KiB		801 Bytes	2022-7-7 12:58:34
AC	我全家SB！！！我没母！！！ (baijinlin)	7ms	384 KiB		490 Bytes	2023-2-11 18:40:19
AC	毕浩宇 (bihaoyu)	7ms	6.8 MiB		473 Bytes	2023-10-20 14:18:57
AC	新壹街校区--税崇峻 (税崇峻)	7ms	6.9 MiB		496 Bytes	2023-7-26 14:49:21
AC	杨颂恩 (yangsongen)	7ms	6.7 MiB		629 Bytes	2023-8-24 21:25:31
AC	新壹街校区-陈琬舒 (空空大师)	7ms	6.9 MiB		463 Bytes	2023-9-24 11:34:13
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	6.9 MiB		505 Bytes	2023-7-25 20:43:09
AC	凌肯 (lingken22006)	7ms	392 KiB		759 Bytes	2022-7-31 18:43:35
AC	韩思辰 (hansichen)	7ms	384 KiB		471 Bytes	2022-11-5 11:31:10
AC	我很6 (zjj22031)	7ms	384 KiB		497 Bytes	2023-3-12 11:01:00
AC	Accepted (周芷乐)	7ms	7.1 MiB	C++14	498 Bytes	2024-6-13 20:22:25
AC	蒋丁非凡	7ms	6.7 MiB		470 Bytes	2023-9-21 17:39:01
AC	益布响完辣 (黄靖益1)	7ms	7 MiB	C++17	442 Bytes	2024-6-2 10:52:31
AC	炸鱼4000+ (dxc)	7ms	7 MiB		490 Bytes	2023-7-2 13:50:59
AC	吴卓轩	7ms	384 KiB		486 Bytes	2022-9-10 14:41:57
AC	56 (13883454928)	7ms	440 KiB		477 Bytes	2023-3-22 21:44:43
AC	黄泓翔	7ms	384 KiB		471 Bytes	2022-10-30 15:26:40
AC	yanyuhan	7ms	6.5 MiB	C++98	485 Bytes	2024-7-4 19:42:12
AC	源著校区-宋昊成 (马冬梅)	7ms	424 KiB		457 Bytes	2023-2-25 17:01:47
AC	Nico	7ms	512 KiB		473 Bytes	2022-12-23 15:47:42
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	7ms	6.8 MiB	C++98	457 Bytes	2024-8-10 12:31:05
AC	05c30-dyh	7ms	512 KiB		462 Bytes	2022-3-5 13:44:09
AC	zjz	7ms	448 KiB		490 Bytes	2022-3-20 20:42:02
AC	杨瀚霖 (yanghanlin)	7ms	384 KiB		488 Bytes	2022-11-5 11:24:10
AC	dengbowen23017	7ms	6.7 MiB		447 Bytes	2023-9-2 21:02:23
AC	新壹街校区-杨轩懿 (杨轩懿1)	7ms	6.9 MiB		470 Bytes	2023-7-27 9:45:14
AC	邹曜丞 (13983097018)	7ms	6.9 MiB		485 Bytes	2023-7-18 18:59:07
AC	wuzhenghan	7ms	420 KiB		680 Bytes	2023-2-27 19:56:27
AC	icwy (zuolun)	7ms	424 KiB		445 Bytes	2022-4-9 14:15:54
AC	时代一校 - 冯隆浩 (冯隆浩)	7ms	436 KiB		473 Bytes	2022-10-22 19:33:03
AC	lll	7ms	384 KiB		486 Bytes	2022-9-27 17:39:20
AC	安闵煜 (anzai)	7ms	7 MiB	C++11	491 Bytes	2024-6-20 14:38:18
AC	邵冠铖 (shaoguancheng22031)	7ms	6.8 MiB		477 Bytes	2023-10-29 13:11:07
AC	Stacy (陈妍西)	7ms	384 KiB		502 Bytes	2022-10-30 16:00:22
AC	秦子越 (13883322087)	7ms	440 KiB		513 Bytes	2023-2-12 14:13:01
AC	何星震 (Jacob)	7ms	384 KiB		466 Bytes	2022-10-1 15:51:50
AC	王锦锐 (wjr)	7ms	6.7 MiB		461 Bytes	2023-8-25 15:07:29
AC	奇怪的正义人！ (leweiqi)	7ms	440 KiB		432 Bytes	2022-10-28 21:34:38
AC	关博源	7ms	432 KiB		522 Bytes	2023-2-24 21:16:59
AC	Jack	7ms	428 KiB		461 Bytes	2022-8-2 17:02:32
AC	chenyifei	7ms	384 KiB		452 Bytes	2022-8-27 17:13:29
AC	阚一鸣	7ms	432 KiB		471 Bytes	2022-10-30 15:24:43
AC	曹埊睿 (caodirui)	7ms	432 KiB		626 Bytes	2023-3-21 19:05:18
AC	王胤钦 (wangyinqin)	7ms	6.9 MiB		479 Bytes	2023-7-9 8:43:35
AC	南坪校区-龙浩睿 (longhaorui)	7ms	440 KiB		479 Bytes	2023-2-11 18:11:53
AC	bvvd	7ms	6.7 MiB	C++98	474 Bytes	2024-8-2 17:22:58
AC	朱老师 (zyp)	7ms	432 KiB		464 Bytes	2022-7-25 16:52:05
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	7ms	6.7 MiB		465 Bytes	2023-9-17 13:35:51
AC	南坪校区-淡昌盛 (Dancs)	7ms	392 KiB		553 Bytes	2023-2-11 11:48:11
AC	张峻熙	7ms	436 KiB		533 Bytes	2022-10-31 21:27:58
AC	明哲瀚 (18580067605)	7ms	384 KiB		485 Bytes	2022-9-29 21:05:01
AC	05c35-hhw	7ms	428 KiB		475 Bytes	2022-8-18 14:25:17
AC	林小博	7ms	384 KiB		481 Bytes	2022-2-19 11:14:17
AC	明哲瀚 (18580067605)	7ms	384 KiB		485 Bytes	2022-9-29 21:04:59
AC	邓智凌	7ms	6.9 MiB		656 Bytes	2023-7-5 21:01:42
AC	洛谷：AIDczy（uid:656765） (chenzeyu)	7ms	512 KiB		456 Bytes	2022-3-4 19:50:32
AC	时代一校蒋帛希 (13983392730)	7ms	444 KiB		475 Bytes	2022-11-12 10:16:41
AC	Harley (郑浩然)	7ms	436 KiB		529 Bytes	2023-4-21 21:26:57
AC	中岛敦 (黄麒瑞)	7ms	6.7 MiB		480 Bytes	2023-9-30 21:10:12
AC	陈雨泽1	7ms	6.7 MiB		491 Bytes	2023-8-29 15:05:25
AC	爱琴海校区-王宥喆 (王宥喆)	7ms	6.9 MiB		448 Bytes	2023-7-5 20:57:23
AC	新壹街陈科言 (cky)	7ms	6.9 MiB		980 Bytes	2023-7-20 10:56:38
AC	不怎么聪明的家伙 (贺俊楠)	7ms	436 KiB		480 Bytes	2023-3-26 18:11:48
AC	牟淳雅	7ms	6.7 MiB		479 Bytes	2023-9-17 19:37:44
AC	chenxiyu	7ms	416 KiB		475 Bytes	2023-2-22 21:55:27
AC	UsMt1 (jiangyuan)	8ms	6.7 MiB		489 Bytes	2023-9-13 21:58:53
AC	贾博涵	8ms	6.8 MiB		445 Bytes	2023-11-1 12:06:26
AC	贾鑫豪 (Mr Sam)	8ms	6.9 MiB		478 Bytes	2023-7-21 19:00:35
AC	新壹街朱启航 (zhuqihang)	8ms	7.2 MiB		756 Bytes	2023-7-11 10:01:58
AC	wangruibo20xh	8ms	6.9 MiB		396 Bytes	2023-8-1 22:33:46
AC	曹雅萱	8ms	7 MiB	C++11	465 Bytes	2024-8-25 12:15:00
AC	你猜呀	8ms	432 KiB		466 Bytes	2023-2-12 15:55:04
AC	叶哲宇 (yzy)	8ms	6.9 MiB		493 Bytes	2023-8-12 16:13:11
AC	ganlin1	8ms	532 KiB		453 Bytes	2023-5-13 11:52:09
AC	黄梓桐 (HuangZiTong)	8ms	412 KiB		818 Bytes	2022-10-1 11:25:57
AC	6 (HIMMZXC1)	8ms	6.9 MiB		460 Bytes	2023-6-24 16:12:15
AC	11451254188 (22029-mjh)	8ms	544 KiB		481 Bytes	2022-11-25 13:22:17
AC	dream	8ms	6.7 MiB		501 Bytes	2023-8-21 20:29:47
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	8ms	384 KiB		440 Bytes	2023-1-5 17:24:48
AC	司雨来 (siyulai)	8ms	440 KiB		505 Bytes	2022-10-6 16:29:31
AC	Him神	8ms	7 MiB		476 Bytes	2023-11-30 19:55:48
AC	诸禹吉 (zhuyuji)	8ms	512 KiB		490 Bytes	2022-8-7 21:08:52
AC	新壹街罗田雨 (罗田雨29)	8ms	6.9 MiB		746 Bytes	2023-8-5 17:48:52
AC	时代二校+马嘉宸 (majiachen)	8ms	7 MiB		477 Bytes	2023-6-28 20:13:49
AC	任远宁 (renyuanning)	8ms	512 KiB		450 Bytes	2022-10-6 21:28:32
AC	缥 (王硕2012)	8ms	384 KiB		664 Bytes	2022-10-2 15:28:40
AC	(金沙天街)严皓月 (严皓月)	8ms	6.9 MiB		524 Bytes	2023-7-22 10:44:25
AC	在煎鱼的肖大总铳 (肖宇航)	8ms	424 KiB		479 Bytes	2023-3-17 21:57:30
AC	(张洛诚)	8ms	440 KiB		646 Bytes	2023-4-17 20:06:05
AC	凌肯 (lingken22006)	8ms	436 KiB		759 Bytes	2022-7-31 18:43:35
AC	旷山 (15213268688)	8ms	6.8 MiB		502 Bytes	2023-6-20 20:16:04
AC	王祎辰 (wangyichen)	8ms	7 MiB		539 Bytes	2023-6-29 20:25:55
AC	葛琮扬	8ms	6.9 MiB		471 Bytes	2023-7-20 11:56:57
AC	xyc (谢雨宸)	8ms	432 KiB		473 Bytes	2022-12-4 11:43:33