我会数数啦2！！

状态	递交者	时间	内存	语言	代码	递交时间
AC	林小博	5ms	384 KiB		169 Bytes	2022-4-5 9:54:52
AC	诸禹吉 (zhuyuji)	5ms	384 KiB		182 Bytes	2022-7-25 19:59:46
AC	TBB (杜昊燃)	5ms	384 KiB		214 Bytes	2022-6-2 20:06:34
AC	muzili	5ms	440 KiB		182 Bytes	2022-4-16 15:48:12
AC	谢博文	5ms	436 KiB		293 Bytes	2022-2-19 9:23:33
AC	李玥漪	5ms	384 KiB		189 Bytes	2022-3-20 10:50:20
AC	阮 (媚狐不吃道旁李)	5ms	6.8 MiB	C++98	187 Bytes	2024-5-25 16:29:18
AC	你爹 (郭铠嘉)	5ms	384 KiB		199 Bytes	2022-2-9 18:18:27
AC	呵呵呵 (陈思琦)	5ms	7 MiB		152 Bytes	2023-8-20 20:19:16
AC	hxb	5ms	440 KiB		214 Bytes	2022-9-14 19:52:49
AC	_add	5ms	384 KiB		263 Bytes	2022-1-19 20:50:54
AC	12345	5ms	384 KiB		189 Bytes	2022-4-15 18:36:05
AC	傅博涛	5ms	384 KiB		176 Bytes	2022-2-27 13:21:27
AC	朱老师 (zyp)	5ms	440 KiB		188 Bytes	2022-8-6 13:58:06
AC	李山水	5ms	444 KiB		234 Bytes	2022-2-8 16:11:40
AC	肖添宇	5ms	384 KiB		223 Bytes	2022-2-20 14:27:47
AC	Ronnie	5ms	428 KiB		175 Bytes	2022-1-22 10:31:31
AC	李禹衡 (liyuheng22006)	5ms	384 KiB		215 Bytes	2023-2-27 21:15:50
AC	时代校区-刘臣原 (微笑王子)	5ms	392 KiB		182 Bytes	2022-4-9 20:57:49
AC	luoluonuoya	5ms	400 KiB		256 Bytes	2022-1-26 16:52:33
AC	zzzrrrxxx	5ms	8.1 MiB		150 Bytes	2023-8-22 18:43:01
AC	Yuan (Zongzi1)	5ms	6.7 MiB	C++17(O2)	208 Bytes	2024-7-18 0:26:47
AC	凌肯 (lingken22006)	5ms	440 KiB		272 Bytes	2022-7-31 21:58:09
AC	傅博涛	5ms	392 KiB		176 Bytes	2022-2-27 13:21:33
AC	炼狱杏寿郎（的粉粉粉粉粉） (sheijiangwohh)	5ms	384 KiB		283 Bytes	2022-2-19 16:09:04
AC	黄俊皓	5ms	440 KiB		280 Bytes	2022-4-23 10:16:19
AC	吴俊成 (wujuncheng)	5ms	440 KiB		197 Bytes	2022-7-10 11:48:31
AC	wangyueru	5ms	6.8 MiB		197 Bytes	2023-6-9 19:35:05
AC	偽艺術家 (chenyanchi22006)	5ms	436 KiB		166 Bytes	2022-8-15 23:20:25
AC	🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕 (bro)	5ms	384 KiB		228 Bytes	2022-1-25 13:10:06
AC	章愉霖	5ms	6.8 MiB		169 Bytes	2023-6-14 19:27:23
AC	张承暄	5ms	7.2 MiB		167 Bytes	2023-7-4 10:59:06
AC	xzf	5ms	7 MiB		228 Bytes	2023-8-20 16:33:05
AC	坤坤荔枝小黑子 (zhonghaotian22006)	5ms	392 KiB		263 Bytes	2022-7-1 9:25:53
AC	曹埊睿 (caodirui)	5ms	412 KiB		164 Bytes	2023-4-13 20:54:26
AC	王泓涵 (whh)	5ms	436 KiB		159 Bytes	2022-7-10 11:17:39
AC	汪子铭	5ms	384 KiB		194 Bytes	2022-3-20 11:53:58
AC	胡宸瑞	5ms	6.9 MiB	C++17	173 Bytes	2024-6-24 22:11:39
AC	陈忝锐	5ms	392 KiB		206 Bytes	2022-2-10 17:42:20
AC	老六（王牌） (mhc)	5ms	392 KiB		197 Bytes	2023-3-29 19:55:10
AC	繁星 (05c35-zzm)	5ms	384 KiB		212 Bytes	2022-11-26 10:26:20
AC	AAA? Prow max (hechenxuan23005)	5ms	7 MiB	C++98	164 Bytes	2024-6-8 16:42:32
AC	魑归sama	5ms	432 KiB		166 Bytes	2022-7-12 16:25:27
AC	郑之策	5ms	384 KiB		186 Bytes	2022-2-10 10:48:37
AC	芒苒忧 (廖迦南)	5ms	384 KiB		218 Bytes	2022-1-26 20:36:04
AC	谢延灏 (xeiyanhao---a handsome boy)	5ms	428 KiB		157 Bytes	2022-3-11 19:43:42
AC	zvt_132 (任子轩)	5ms	7 MiB		172 Bytes	2023-7-13 14:54:46
AC	17779	5ms	404 KiB		145 Bytes	2022-3-11 21:49:51
AC	小忙果 (王昱杰)	5ms	6.9 MiB		187 Bytes	2023-7-18 8:41:00
AC	杨睎尧	5ms	400 KiB		195 Bytes	2022-4-5 9:58:42
AC	蒲梓勋 (puzixun)	5ms	6.9 MiB		219 Bytes	2023-6-9 19:38:17
AC	MoonLight ( aaa)	5ms	392 KiB		168 Bytes	2022-1-15 11:10:01
AC	wangjunhan	5ms	392 KiB		188 Bytes	2022-3-5 18:21:30
AC	tad (OP AI)	5ms	6.7 MiB	C++11	179 Bytes	2024-6-29 14:46:56
AC	新壹街校区--税崇峻 (税崇峻)	5ms	6.9 MiB		162 Bytes	2023-8-17 15:23:08
AC	王胤钦 (wangyinqin)	5ms	384 KiB		164 Bytes	2022-4-16 16:05:26
AC	新壹街.曾祥睿 (zxr)	5ms	6.7 MiB		171 Bytes	2023-9-14 21:00:59
AC	谭懿轩 (yanyixuan)	5ms	488 KiB		168 Bytes	2022-2-15 19:32:40
AC	新壹街校区-陈琬舒 (空空大师)	5ms	6.8 MiB		165 Bytes	2023-10-28 10:34:48
AC	方子谦 (方子谦00)	5ms	400 KiB		256 Bytes	2022-3-20 11:18:38
AC	陈雨泽1	6ms	384 KiB		176 Bytes	2023-2-18 11:22:45
AC	马渝杭 (mayuhang)	6ms	440 KiB		175 Bytes	2022-8-11 19:22:40
AC	l;k (陈彬宾)	6ms	388 KiB		239 Bytes	2022-5-7 20:57:11
AC	炼狱杏寿郎（的粉粉粉粉粉） (sheijiangwohh)	6ms	384 KiB		283 Bytes	2022-2-19 16:08:15
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	512 KiB		215 Bytes	2023-5-14 18:03:53
AC	张峻尘 (zjc)	6ms	428 KiB		178 Bytes	2022-3-12 14:01:21
AC	你爹 (郭铠嘉)	6ms	392 KiB		199 Bytes	2022-3-22 21:54:14
AC	陈杰晟	6ms	384 KiB		191 Bytes	2022-2-20 10:48:44
AC	疯神芭芭脱丝 (李卓修)	6ms	384 KiB		211 Bytes	2022-1-23 20:09:10
AC	新壹街校区-罗斤天 (罗斤天)	6ms	384 KiB		180 Bytes	2022-4-16 16:14:25
AC	张月恒	6ms	6.9 MiB	C++98(O2)	179 Bytes	2024-8-23 15:24:15
AC	张瑞博	6ms	7.2 MiB	C++11	189 Bytes	2024-4-20 23:28:10
AC	wuqilin	6ms	384 KiB		185 Bytes	2023-4-1 9:48:30
AC	zhangyouze (张佑泽)	6ms	6.8 MiB		180 Bytes	2023-10-16 20:59:11
AC	时代1校-杨宇轩 (杨宇轩)	6ms	6.7 MiB		174 Bytes	2023-8-31 17:33:07
AC	huanglu	6ms	7.2 MiB		165 Bytes	2023-7-18 9:29:52
AC	葛广言	6ms	7.2 MiB	C++98	157 Bytes	2024-4-24 20:00:03
AC	火爆肥肠（杨弘毅） (火爆肥肠)	6ms	440 KiB		213 Bytes	2022-2-24 21:43:35
AC	况奕辛 (KYX_yyds)	6ms	432 KiB		258 Bytes	2022-3-8 21:03:27
AC	在煎鱼的肖大总铳 (肖宇航)	6ms	7 MiB		198 Bytes	2023-9-24 11:13:15
AC	刘煜轩	6ms	6.8 MiB		185 Bytes	2023-10-24 21:36:25
AC	时代一校蒋帛希 (13983392730)	6ms	384 KiB		169 Bytes	2023-2-12 15:51:04
AC	曾龙兮	6ms	384 KiB		170 Bytes	2023-3-26 17:17:07
AC	时代二校-杨林老师-黄浦轩 (黄px)	6ms	6.9 MiB	C++11	183 Bytes	2024-8-16 14:39:56
AC	时代2校-程俊燃 (chengjunran)	6ms	428 KiB		167 Bytes	2023-4-27 18:15:19
AC	崔欧辰	6ms	6.9 MiB	C++11	240 Bytes	2024-8-22 9:50:47
AC	chen (peter)	6ms	440 KiB		182 Bytes	2022-7-19 14:14:29
AC	贾博涵	6ms	392 KiB		241 Bytes	2023-3-29 20:07:19
AC	牟淳雅	6ms	6.8 MiB		224 Bytes	2023-9-24 12:02:04
AC	zhangyh (张育菡)	6ms	436 KiB		179 Bytes	2022-6-10 22:31:17
AC	星野光 (Hoshino Hikari)	6ms	6.8 MiB		236 Bytes	2023-10-24 18:59:22
AC	弹射起飞 ? 冲 ! (吴周周)	6ms	7 MiB	C++20(O2)	209 Bytes	2024-6-17 12:08:29
AC	新壹街校区-杨轩懿 (杨轩懿1)	6ms	6.9 MiB		195 Bytes	2023-7-25 12:44:46
AC	时代一校-赵彦博 (zyb)	6ms	6.7 MiB		269 Bytes	2023-8-24 16:15:37
AC	黄立信	6ms	6.9 MiB		211 Bytes	2023-10-15 13:29:42
AC	wuqi	6ms	6.9 MiB		233 Bytes	2023-7-26 15:47:39
AC	叶哲宇 (yzy)	6ms	504 KiB		178 Bytes	2023-4-16 8:44:25
AC	李龙腾 (llt)	6ms	7 MiB		156 Bytes	2023-6-29 20:53:16
AC	(张洛诚)	6ms	384 KiB		233 Bytes	2023-4-27 18:51:57
AC	Erin	6ms	7 MiB	C++98	179 Bytes	2024-5-4 20:00:05