我会数数啦1！！

状态	递交者	时间	内存	语言	代码	递交时间
AC	李玥漪	6ms	392 KiB		177 Bytes	2022-3-17 22:29:26
AC	杨瀚霖 (yanghanlin)	6ms	384 KiB		147 Bytes	2022-12-10 11:37:58
AC	wzzjnb2012	6ms	384 KiB		195 Bytes	2022-10-2 17:30:29
AC	韩思辰 (hansichen)	6ms	384 KiB		135 Bytes	2022-12-10 11:22:43
AC	heyi	6ms	6.8 MiB	C++98(O2)	151 Bytes	2024-8-10 13:17:21
AC	殷语函	6ms	6.9 MiB	C++11	150 Bytes	2024-8-23 21:48:58
AC	吴思谛 (wusidi)	6ms	392 KiB		147 Bytes	2022-4-23 10:33:48
AC	朱老师 (zyp)	6ms	420 KiB		210 Bytes	2022-11-16 18:56:29
AC	zzl	6ms	6.8 MiB		152 Bytes	2023-11-7 0:46:01
AC	游智棋	6ms	7.1 MiB	C++17	151 Bytes	2024-4-20 22:06:21
AC	你爹 (郭铠嘉)	6ms	512 KiB		144 Bytes	2022-3-22 21:53:34
AC	leisixian (22029-lyh)	6ms	6.9 MiB		137 Bytes	2023-8-17 16:40:27
AC	叶雨昊 (yeyuhao22006)	6ms	388 KiB		138 Bytes	2022-10-25 21:44:20
AC	新壹街校区-陈琬舒 (空空大师)	6ms	7 MiB		131 Bytes	2023-10-28 10:32:34
AC	秦子越 (13883322087)	6ms	436 KiB		213 Bytes	2022-2-19 18:15:53
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	6ms	428 KiB		136 Bytes	2022-9-3 18:35:38
AC	新壹街校区-陈品烨 (陈品烨)	6ms	6.8 MiB		145 Bytes	2023-10-2 13:22:16
AC	陈骏逸 (chenjunyi)	6ms	436 KiB		129 Bytes	2022-7-17 13:52:25
AC	郑尧 (zhengyao)	6ms	6.8 MiB		146 Bytes	2023-10-16 19:22:28
AC	龙思颖 (lsy)	6ms	416 KiB		157 Bytes	2023-3-13 20:23:28
AC	葛广言	6ms	7.3 MiB	C++98	125 Bytes	2024-4-24 19:47:27
AC	李晨希	6ms	7 MiB		151 Bytes	2023-7-13 8:59:41
AC	77777777	6ms	6.6 MiB	C++17	158 Bytes	2024-7-18 21:28:35
AC	况奕辛 (KYX_yyds)	6ms	440 KiB		197 Bytes	2022-3-8 21:03:09
AC	王晴萱	6ms	7 MiB		149 Bytes	2023-7-13 16:14:44
AC	李俊钢	6ms	440 KiB		189 Bytes	2023-2-4 11:43:42
AC	你爹 (郭铠嘉)	6ms	436 KiB		144 Bytes	2022-3-19 14:01:14
AC	17779	6ms	444 KiB		123 Bytes	2022-3-11 21:47:24
AC	李金珂集训号	6ms	512 KiB		134 Bytes	2022-8-12 14:05:46
AC	chaikexu	6ms	436 KiB		145 Bytes	2022-11-16 13:50:23
AC	执剑人罗辑 (Jasson)	6ms	384 KiB		137 Bytes	2022-10-15 17:05:57
AC	无尽的想象 (谭仕高)	6ms	392 KiB		167 Bytes	2022-12-20 17:18:59
AC	没有此人 (akm)	6ms	384 KiB		137 Bytes	2022-10-22 17:58:19
AC	余晨浩 (yuchenhao)	6ms	7.8 MiB		141 Bytes	2023-8-22 11:16:16
AC	444444444 (唐跃元)	6ms	384 KiB		165 Bytes	2023-1-21 11:33:42
AC	时代2校-程俊燃 (chengjunran)	6ms	436 KiB		179 Bytes	2023-4-24 20:05:01
AC	冒牌陈杰晟【MOD】 (wed)	6ms	432 KiB		134 Bytes	2022-3-13 17:47:02
AC	缥 (王硕2012)	6ms	420 KiB		180 Bytes	2022-10-16 10:38:10
AC	葛琮扬	6ms	6.9 MiB		109 Bytes	2023-7-20 12:53:47
AC	Nico	6ms	392 KiB		225 Bytes	2022-12-24 13:46:24
AC	邹曜丞 (13983097018)	6ms	444 KiB		153 Bytes	2023-4-30 14:37:54
AC	徐康景 (dcm)	6ms	436 KiB		139 Bytes	2022-10-22 11:46:05
AC	小忙果 (王昱杰)	6ms	6.9 MiB		140 Bytes	2023-7-18 8:40:38
AC	xuniaoyin (徐袅音)	6ms	6.9 MiB		120 Bytes	2023-7-12 19:06:34
AC	时代一校蒋帛希 (13983392730)	6ms	384 KiB		135 Bytes	2022-10-13 21:20:54
AC	新壹街.曾祥睿 (zxr)	6ms	6.7 MiB		131 Bytes	2023-9-14 21:00:22
AC	wangyueru	6ms	392 KiB		138 Bytes	2022-10-15 19:50:15
AC	tyx_9192596	6ms	436 KiB		136 Bytes	2023-3-18 17:20:25
AC	zyl	6ms	7.3 MiB		136 Bytes	2024-1-4 10:12:22
AC	张峻熙	6ms	436 KiB		147 Bytes	2022-10-31 21:29:24
AC	wangziji	6ms	432 KiB		131 Bytes	2023-4-15 10:36:52
AC	炸鱼4000+ (dxc)	6ms	504 KiB		152 Bytes	2023-3-8 20:44:20
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)	6ms	436 KiB		161 Bytes	2023-5-13 12:19:52
AC	新壹街陈科言 (cky)	6ms	7.2 MiB		142 Bytes	2023-7-19 11:47:06
AC	sb (吴振宇)	6ms	440 KiB		169 Bytes	2022-12-23 20:09:25
AC	yangbinyu	6ms	440 KiB		144 Bytes	2022-9-25 12:12:50
AC	三差学生(尘埃蓝莓) (白佳睿)	6ms	6.9 MiB		150 Bytes	2023-7-7 20:09:59
AC	德克萨斯做的到吗 (liyangbao)	6ms	440 KiB		210 Bytes	2022-11-7 17:44:44
AC	yanglang	6ms	436 KiB		139 Bytes	2022-10-23 10:07:16
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	6ms	428 KiB		184 Bytes	2023-1-12 16:58:24
AC	繁星 (05c35-zzm)	6ms	432 KiB		156 Bytes	2022-11-6 11:05:53
AC	车涌强	6ms	7 MiB		154 Bytes	2023-6-17 17:51:05
AC	新壹街-王俊博 (王俊博)	6ms	7 MiB		125 Bytes	2023-7-10 14:04:19
AC	zhangxinyue	6ms	440 KiB		131 Bytes	2022-12-24 10:57:14
AC	lafuzbc	6ms	436 KiB		127 Bytes	2022-8-7 16:54:50
AC	除了我全部人都是SB (车涌樯)	6ms	6.8 MiB		127 Bytes	2023-7-14 18:05:09
AC	周靖松 (ZhouJS)	6ms	428 KiB		139 Bytes	2023-1-16 20:43:41
AC	南坪校区-郑力博 (zhenglibo23003)	6ms	428 KiB		142 Bytes	2023-3-11 20:51:10
AC	wuzhenghan	6ms	444 KiB		148 Bytes	2022-11-2 21:58:03
AC	颜梓宇	6ms	6.9 MiB		138 Bytes	2023-8-8 18:42:25
AC	444444444 (唐跃元)	6ms	384 KiB		165 Bytes	2023-1-21 11:33:58
AC	杨淇瑞 (杨淇瑞29)	6ms	6.9 MiB		157 Bytes	2023-7-18 19:52:43
AC	孙烽轶 (sfy)	6ms	7 MiB		130 Bytes	2023-7-3 16:59:53
AC	AAA? (hechenxuan23005)	6ms	7 MiB	C++98	134 Bytes	2024-6-8 16:41:17
AC	(张洛诚)	6ms	436 KiB		155 Bytes	2023-4-20 18:42:18
AC	RanHao	6ms	6.9 MiB		141 Bytes	2023-7-22 11:41:07
AC	李龙腾 (llt)	7ms	7 MiB		154 Bytes	2023-6-29 20:52:58
AC	你猜呀	7ms	444 KiB		166 Bytes	2023-3-12 10:38:05
AC	张祖名	7ms	6.9 MiB		144 Bytes	2023-7-13 21:33:53
AC	刘致言	7ms	420 KiB		154 Bytes	2023-3-11 9:31:29
AC	新壹街校区--税崇峻 (税崇峻)	7ms	6.9 MiB		134 Bytes	2023-7-28 20:17:53
AC	西一街吴昀桓 (吴昀桓)	7ms	8.2 MiB		134 Bytes	2023-8-23 17:44:33
AC	陈梓宇	7ms	6.7 MiB		134 Bytes	2023-8-23 15:23:35
AC	陈家齐 (陈家齐1)	7ms	436 KiB		152 Bytes	2023-3-17 21:53:25
AC	邵冠铖 (shaoguancheng22031)	7ms	392 KiB		213 Bytes	2022-11-16 19:00:28
AC	xzf	7ms	6.9 MiB		188 Bytes	2023-8-20 16:23:06
AC	杨馨涵	7ms	7.1 MiB		139 Bytes	2023-12-14 19:41:12
AC	希蒙 (zhengxingya)	7ms	7.1 MiB		229 Bytes	2023-8-23 16:17:13
AC	龚铭俊 (哈哈哈)	7ms	6.9 MiB		151 Bytes	2023-8-6 18:28:51
AC	时代二校-陈天成 (鸭缩毛巾)	7ms	444 KiB		197 Bytes	2023-3-27 19:27:35
AC	yiqiuyu	7ms	440 KiB		128 Bytes	2023-3-15 20:28:56
AC	hrz	8ms	7.3 MiB		158 Bytes	2024-1-21 14:19:01
AC	AI创客	8ms	6.7 MiB		128 Bytes	2023-11-20 22:13:09
AC	陈诺	8ms	7 MiB		138 Bytes	2024-1-1 15:30:46
AC	段淏泷	8ms	7.1 MiB		143 Bytes	2024-1-18 20:09:42
AC	dyp (hhy)	8ms	7.1 MiB		136 Bytes	2023-12-9 21:48:09
AC	陌生人 (涂玉龙)	8ms	7 MiB		134 Bytes	2024-1-20 15:11:18
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	8ms	6.9 MiB		157 Bytes	2023-12-21 20:51:01
AC	冉浩然	8ms	7.2 MiB		144 Bytes	2023-11-25 18:49:43
AC	新壹街校区-周士杰 (zsj)	9ms	464 KiB		130 Bytes	2023-5-19 18:50:08