数字组合

状态	递交者	时间	内存	语言	代码	递交时间
AC	新壹街校区-杨轩懿 (杨轩懿1)	11ms	6.8 MiB		246 Bytes	2023-10-28 20:59:21
AC	时代2校-程俊燃 (chengjunran)	11ms	6.8 MiB		277 Bytes	2023-9-2 17:22:27
AC	huanglu	11ms	428 KiB		368 Bytes	2022-11-4 11:19:54
AC	坤坤荔枝小黑子 (zhonghaotian22006)	11ms	440 KiB		232 Bytes	2022-11-23 9:11:35
AC	刘老师 (图书管理员)	11ms	432 KiB		333 Bytes	2023-1-1 17:09:11
AC	弹射起飞 ? 冲 ! (吴周周)	11ms	6.8 MiB		361 Bytes	2023-9-2 17:18:37
AC	朱泽晟	11ms	424 KiB		447 Bytes	2022-10-24 22:21:10
AC	xuniaoyin (徐袅音)	11ms	6.9 MiB		457 Bytes	2023-8-7 14:14:45
AC	爱琴海校区-刁钲洋 (刁钲洋)	11ms	440 KiB		541 Bytes	2023-5-4 20:50:09
AC	陈秋石	11ms	432 KiB		316 Bytes	2022-11-26 11:07:00
AC	德克萨斯做的到吗 (liyangbao)	11ms	512 KiB		408 Bytes	2022-11-8 23:31:43
AC	sqmyb	11ms	512 KiB		280 Bytes	2023-1-5 14:45:45
AC	quzhibo	11ms	408 KiB		510 Bytes	2022-10-26 12:08:37
AC	xiongxinyao	11ms	512 KiB		279 Bytes	2023-3-12 10:37:58
AC	zhangheyi22006	11ms	512 KiB		247 Bytes	2022-10-26 18:58:53
AC	1396013295	11ms	512 KiB		355 Bytes	2022-10-23 9:25:07
AC	疯神芭芭脱丝 (李卓修)	11ms	384 KiB		266 Bytes	2022-10-24 16:59:37
AC	郭人瑀1	11ms	444 KiB		491 Bytes	2022-12-9 21:08:25
AC	李廷旭 (litingxu)	11ms	6.8 MiB		215 Bytes	2023-10-24 21:29:48
AC	姚宏逸	11ms	428 KiB		441 Bytes	2022-10-19 14:16:49
AC	11111	11ms	384 KiB		310 Bytes	2022-10-26 19:42:07
AC	李龙腾 (llt)	11ms	384 KiB		263 Bytes	2022-10-19 19:15:39
AC	蒋青峰	11ms	436 KiB		292 Bytes	2023-3-19 12:37:39
AC	dengduxi	11ms	6.8 MiB		590 Bytes	2023-6-23 15:25:45
AC	极为的好van的 (lyq)	11ms	432 KiB		266 Bytes	2023-1-11 19:57:27
AC	老六 (......)	11ms	440 KiB		167 Bytes	2022-11-2 19:19:08
AC	蒲梓勋 (puzixun)	12ms	392 KiB		292 Bytes	2022-10-19 20:35:23
AC	dengduxi	12ms	440 KiB		254 Bytes	2023-1-20 14:29:51
AC	余龙恩 (小码君)	12ms	512 KiB		445 Bytes	2022-11-25 14:37:00
AC	11111	12ms	384 KiB		322 Bytes	2022-10-26 19:41:40
AC	徐子恩 (Cow)	12ms	436 KiB		390 Bytes	2022-10-15 23:26:14
AC	李林峰 (金克拉)	13ms	384 KiB		259 Bytes	2022-10-19 19:07:52
AC	AI创客	13ms	7.4 MiB		259 Bytes	2023-12-30 11:09:20
AC	何晟瑞 (hsr01)	14ms	416 KiB		280 Bytes	2022-11-16 15:41:48
AC	许炜铭 (xuweiming)	19ms	6.9 MiB		323 Bytes	2023-11-10 22:26:04
AC	谭红中 (不知道)	21ms	512 KiB		456 Bytes	2022-10-15 22:31:10
AC	love GanYu (爱搞笑的张浩宇)	44ms	532 KiB		479 Bytes	2024-4-14 11:17:33
AC	张楷岩	44ms	536 KiB		504 Bytes	2024-4-6 20:27:12
AC	阮 (媚狐不吃道旁李)	48ms	532 KiB		258 Bytes	2024-4-5 21:37:47
AC	周浩楠 (开朗的周好难)	48ms	768 KiB		435 Bytes	2024-4-13 22:03:08
AC	ycy	48ms	764 KiB		456 Bytes	2022-10-21 19:29:06
AC	刘老师 (图书管理员)	49ms	536 KiB		478 Bytes	2024-4-13 8:38:54
AC	hyh	50ms	536 KiB		239 Bytes	2024-3-2 9:34:51
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	52ms	716 KiB		371 Bytes	2024-4-5 18:17:07
AC	南坪校区-龙浩睿 (longhaorui)	63ms	2.9 MiB	Python 2	262 Bytes	2023-5-10 18:54:07
AC	11451254188 (22029-mjh)	86ms	9.3 MiB	Python 3	245 Bytes	2024-4-25 19:34:03
AC	zyp (wangjunling23010)	130ms	3.9 MiB	Python 3	249 Bytes	2023-5-10 18:53:50
AC	文硕 (文硕1)	135ms	4 MiB	Python 3	178 Bytes	2022-10-22 17:53:54
AC	朱老师 (zyp)	136ms	3.9 MiB	Python 3	199 Bytes	2022-10-29 18:15:07
AC	南坪校区-郑力博 (zhenglibo23003)	139ms	3.9 MiB	Python 3	236 Bytes	2023-5-10 18:54:51
AC	朱老师 (zyp)	140ms	3.9 MiB	Python 3	199 Bytes	2022-10-29 18:15:06
AC	baijinlin22003	142ms	3.9 MiB	Python 3	186 Bytes	2022-10-29 18:13:55
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)	142ms	3.9 MiB	Python 3	210 Bytes	2023-5-10 18:54:26
AC	penghy	143ms	9 MiB	Python 3	277 Bytes	2023-7-6 18:50:14
AC	朱老师 (zyp)	143ms	3.9 MiB	Python 3	199 Bytes	2022-10-29 18:15:08
AC	zhenglibo22003	143ms	3.9 MiB	Python 3	187 Bytes	2022-10-29 18:12:47
AC	baijinlin22003	143ms	3.9 MiB	Python 3	186 Bytes	2022-10-29 18:13:56
AC	朱老师 (zyp)	143ms	3.9 MiB	Python 3	199 Bytes	2022-10-29 18:09:50
AC	baijinlin22003	144ms	3.9 MiB	Python 3	186 Bytes	2022-10-29 18:13:55
AC	11451254188 (22029-mjh)	144ms	3.9 MiB	Python 3	245 Bytes	2023-5-10 18:54:00
AC	baijinlin22003	144ms	3.9 MiB	Python 3	186 Bytes	2022-10-29 18:13:54
AC	baijinlin22003	145ms	3.9 MiB	Python 3	186 Bytes	2022-10-29 18:13:54
AC	sb (linjiayu23010)	146ms	3.9 MiB	Python 3	290 Bytes	2023-5-10 18:56:57
AC	朱老师 (zyp)	146ms	3.9 MiB	Python 3	199 Bytes	2022-10-29 18:15:05
AC	朱老师 (zyp)	147ms	3.9 MiB	Python 3	199 Bytes	2022-10-29 18:15:07
AC	朱老师 (zyp)	148ms	3.9 MiB	Python 3	333 Bytes	2023-5-10 18:53:51
AC	朱老师 (zyp)	149ms	3.9 MiB	Python 3	199 Bytes	2022-10-29 18:15:08
AC	baijinlin22003	149ms	3.9 MiB	Python 3	186 Bytes	2022-10-29 18:13:55
AC	baijinlin22003	151ms	3.9 MiB	Python 3	186 Bytes	2022-10-29 18:13:54
AC	baijinlin22003	152ms	3.9 MiB	Python 3	186 Bytes	2022-10-29 18:13:56
AC	朱老师 (zyp)	153ms	3.9 MiB	Python 3	199 Bytes	2022-10-29 18:15:07
AC	baijinlin22003	153ms	3.9 MiB	Python 3	186 Bytes	2022-10-29 18:13:52
AC	朱老师 (zyp)	154ms	3.9 MiB	Python 3	199 Bytes	2022-10-29 18:15:06
AC	龙吉先 (ljx)	155ms	3.9 MiB	Python 3	236 Bytes	2023-5-10 19:30:23
AC	baijinlin22003	157ms	3.9 MiB	Python 3	186 Bytes	2022-10-29 18:13:54
AC	龙吉先 (ljx)	157ms	3.9 MiB	Python 3	236 Bytes	2023-5-10 19:30:40
AC	朱老师 (zyp)	165ms	3.9 MiB	Python 3	199 Bytes	2022-10-29 18:15:06