数位递增数

状态	递交者	时间	内存	语言	代码	递交时间
AC	赵泳鑫 (zhaoyongxin)	16ms	424 KiB		508 Bytes	2022-10-29 17:52:52
AC	源著校区陈锐霖 (13983855850)	16ms	6.9 MiB		392 Bytes	2023-7-9 20:01:56
AC	刘老师 (图书管理员)	16ms	476 KiB		352 Bytes	2023-1-1 17:58:51
AC	徐瑀阳	16ms	7 MiB	C++98	370 Bytes	2024-8-24 17:49:19
AC	xiongxinyao	16ms	384 KiB		575 Bytes	2023-3-12 10:35:43
AC	zry	16ms	384 KiB		379 Bytes	2022-10-16 10:27:21
AC	zhm123	16ms	440 KiB		316 Bytes	2022-10-26 15:45:25
AC	ZZI (裴浩钧)	16ms	6.9 MiB		283 Bytes	2023-7-9 20:13:48
AC	坤坤荔枝小黑子 (zhonghaotian22006)	16ms	432 KiB		580 Bytes	2022-11-25 9:25:55
AC	刘致言	16ms	392 KiB		296 Bytes	2022-10-26 19:50:52
AC	李彦臻	16ms	6.9 MiB		322 Bytes	2023-7-2 19:59:07
AC	蒲梓勋 (puzixun)	16ms	440 KiB		375 Bytes	2022-10-27 20:13:15
AC	金锦泽 (jinjinze)	16ms	384 KiB		347 Bytes	2022-10-26 19:23:24
AC	曹埊睿 (caodirui)	16ms	512 KiB		306 Bytes	2023-4-27 20:26:44
AC	zhangyh (张育菡)	16ms	512 KiB		338 Bytes	2022-10-16 9:10:58
AC	源著校区陈锐霖 (13983855850)	16ms	6.9 MiB		392 Bytes	2023-7-9 20:02:47
AC	赵泳鑫 (zhaoyongxin)	16ms	512 KiB		508 Bytes	2022-7-17 10:42:03
AC	王重道	16ms	392 KiB		291 Bytes	2022-10-26 19:01:52
AC	源著校区陈锐霖 (13983855850)	16ms	6.9 MiB		392 Bytes	2023-7-9 20:05:08
AC	李林峰 (金克拉)	16ms	400 KiB		319 Bytes	2022-10-26 19:50:13
AC	老六 (......)	16ms	512 KiB		293 Bytes	2023-1-1 13:22:32
AC	wuqilin	16ms	424 KiB		296 Bytes	2022-10-26 19:51:20
AC	源著校区陈锐霖 (13983855850)	16ms	6.9 MiB		392 Bytes	2023-7-9 20:02:39
AC	Tender. (05c05-zhou)	16ms	440 KiB		324 Bytes	2022-10-16 13:39:48
AC	wangzihang	17ms	7 MiB		293 Bytes	2023-11-11 13:12:06
AC	罗翌珂 (dangdang)	17ms	440 KiB		440 Bytes	2022-10-16 17:24:02
AC	RanHao	17ms	6.9 MiB		287 Bytes	2023-8-18 15:41:37
AC	傅翊航 (fyh)	17ms	440 KiB		280 Bytes	2022-10-16 12:08:37
AC	本人天生贪生pass (05c41-cqs)	18ms	384 KiB		426 Bytes	2023-2-22 19:08:44
AC	1396013295	18ms	436 KiB		847 Bytes	2022-10-23 9:33:54
AC	CK (李弘毅)	18ms	7.1 MiB		355 Bytes	2023-11-11 17:26:10
AC	杨浩灵 (金坷拉)	18ms	432 KiB	C++	425 Bytes	2022-11-5 15:39:52
AC	杨浩灵 (金坷拉)	18ms	392 KiB	C++	380 Bytes	2022-11-5 15:40:43
AC	colin1112 (墙凌可)	18ms	440 KiB		632 Bytes	2023-2-21 19:09:24
AC	xuniaoyin (徐袅音)	19ms	6.8 MiB		952 Bytes	2023-10-1 21:09:34
AC	李禹衡 (liyuheng22006)	19ms	384 KiB		278 Bytes	2022-10-25 19:34:33
AC	蓝色妖姬 (jiangpeiyu)	19ms	392 KiB		445 Bytes	2022-11-7 10:18:55
AC	dengduxi	19ms	6.8 MiB		407 Bytes	2023-6-23 11:37:49
AC	杜启苇 (duqiwei)	20ms	384 KiB		383 Bytes	2022-10-21 20:13:50
AC	姚宏逸	20ms	440 KiB		253 Bytes	2022-10-19 14:23:47
AC	经常消失 (小萝卜)	20ms	512 KiB		445 Bytes	2023-2-12 20:59:54
AC	dengduxi	20ms	432 KiB		407 Bytes	2023-2-22 18:53:57
AC	德克萨斯做的到吗 (liyangbao)	20ms	512 KiB		399 Bytes	2022-11-6 11:39:39
AC	MitchellZhong	21ms	432 KiB		327 Bytes	2023-1-24 19:28:50
AC	樊竣熠 (lft1114)	21ms	436 KiB		437 Bytes	2022-8-10 12:37:57
AC	朱老师 (zyp)	21ms	384 KiB		344 Bytes	2022-10-26 19:43:34
AC	朱老师 (zyp)	22ms	444 KiB		312 Bytes	2022-10-25 19:34:04
AC	wzzjnb2012	24ms	436 KiB		637 Bytes	2022-11-13 8:25:47
AC	源著校区-刘洋-付柏乐 (付柏乐)	61ms	764 KiB		393 Bytes	2024-3-5 19:05:20
AC	黄立信	65ms	536 KiB		464 Bytes	2024-3-5 20:10:06
AC	源著+王新睿 (王新睿)	67ms	764 KiB		375 Bytes	2024-4-6 10:39:05
AC	章愉霖	69ms	532 KiB		307 Bytes	2024-3-7 19:33:15
AC	嘉宝 (王淳恺)	69ms	532 KiB		361 Bytes	2024-4-13 14:04:17
AC	xuniaoyin (徐袅音)	71ms	768 KiB		408 Bytes	2024-4-8 21:06:03
AC	明轩 (吕同学)	82ms	548 KiB		672 Bytes	2024-3-2 8:36:37
AC	龙吉先 (ljx)	252ms	3.9 MiB	Python 3	262 Bytes	2023-5-10 20:04:27
AC	南坪校区-龙浩睿 (longhaorui)	255ms	3.9 MiB	Python 3	293 Bytes	2023-5-10 20:00:04
AC	zvt_132 (任子轩)	258ms	7 MiB	C++98	416 Bytes	2024-8-24 18:01:39
AC	sb (linjiayu23010)	259ms	3.9 MiB	Python 3	276 Bytes	2023-5-10 20:00:45
AC	zyp (wangjunling23010)	261ms	3.9 MiB	Python 3	264 Bytes	2023-5-10 19:55:29
AC	南坪校区-郑力博 (zhenglibo23003)	261ms	3.9 MiB	Python 3	254 Bytes	2023-5-10 19:59:53
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)	266ms	3.9 MiB	Python 3	293 Bytes	2023-5-10 19:59:12
AC	zyp (wangjunling23010)	266ms	3.9 MiB	Python 3	264 Bytes	2023-5-10 19:54:41
AC	梨冻亿 (wiueh)	270ms	4 MiB	Python 3	348 Bytes	2022-1-23 20:10:40
AC	11451254188 (22029-mjh)	271ms	3.9 MiB	Python 3	273 Bytes	2023-5-10 20:00:42
AC	11451254188 (22029-mjh)	276ms	3.9 MiB	Python 3	273 Bytes	2023-5-10 19:58:55
AC	zyp (wangjunling23010)	277ms	3.9 MiB	Python 3	264 Bytes	2023-5-10 19:55:30
AC	朱老师 (zyp)	280ms	3.9 MiB	Python 3	1.3 KiB	2023-5-10 19:53:26
AC	南坪协信校区-叶钟阳 (yezhongyang23010)	289ms	3.9 MiB	Python 3	428 Bytes	2023-5-10 19:59:38