数羊(循环结构)

状态	递交者	时间	内存	语言	代码	递交时间

AC	余彦瑞	14ms	392 KiB		176 Bytes	2022-3-20 11:10:03
AC	wuzhenghan	14ms	440 KiB		220 Bytes	2022-12-28 21:49:58
AC	任瑞的学生 (jiangyadong)	14ms	392 KiB		161 Bytes	2022-6-19 13:19:02
AC	杜俊宏	14ms	436 KiB		176 Bytes	2022-4-24 17:31:56
AC	偽艺術家 (chenyanchi22006)	14ms	512 KiB		177 Bytes	2022-8-15 23:46:16
AC	yaokaixuan	14ms	388 KiB		174 Bytes	2022-1-22 10:31:27
AC	CK (李弘毅)	14ms	7.2 MiB	C++11(O2)	287 Bytes	2024-4-29 21:05:20
AC	Randy Marsh (杨子腾)	14ms	396 KiB		204 Bytes	2022-5-20 19:03:38
AC	Tang	14ms	384 KiB		290 Bytes	2022-2-19 10:59:48
AC	李松泽 (lisongze)	14ms	512 KiB		165 Bytes	2022-4-10 13:51:06
AC	wangxingyue	14ms	408 KiB		208 Bytes	2022-2-9 21:23:27
AC	吴俊成 (wujuncheng)	14ms	512 KiB		208 Bytes	2022-7-10 12:37:28
AC	游智棋	14ms	392 KiB		216 Bytes	2022-7-2 11:12:29
AC	伍行念 (wuxingnian)	14ms	6.8 MiB		186 Bytes	2023-9-29 14:58:46
AC	算法战神 (konglinghao)	14ms	7 MiB	C++98	165 Bytes	2024-5-19 16:44:53
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	14ms	384 KiB		175 Bytes	2022-9-3 18:43:21
AC	罗翌珂 (dangdang)	14ms	424 KiB		200 Bytes	2022-7-2 11:08:13
AC	呵呵呵 (陈思琦)	14ms	384 KiB		158 Bytes	2022-12-3 16:49:27
AC	Randy Marsh (杨子腾)	14ms	384 KiB		204 Bytes	2022-5-20 19:03:44
AC	Randy Marsh (杨子腾)	14ms	392 KiB		204 Bytes	2022-5-20 19:03:51
AC	qwerty	14ms	436 KiB		169 Bytes	2022-3-12 19:47:18
AC	德意志第三帝国 (陈远桥)	14ms	512 KiB		150 Bytes	2022-3-13 10:19:23
AC	Randy Marsh (杨子腾)	14ms	392 KiB		204 Bytes	2022-5-20 19:04:00
AC	17779	14ms	512 KiB		158 Bytes	2022-3-14 14:57:58
AC	经常消失 (小萝卜)	14ms	384 KiB		216 Bytes	2022-2-19 14:06:03
AC	kkksc03 (彭士锋)	14ms	392 KiB		162 Bytes	2022-1-21 20:10:04
AC	谭懿轩 (yanyixuan)	14ms	444 KiB		164 Bytes	2022-2-15 20:09:49
AC	zhangyh (张育菡)	14ms	436 KiB		200 Bytes	2022-6-10 22:33:02
AC	xiangsiyu	14ms	384 KiB		191 Bytes	2022-6-26 9:25:39
AC	吕同学是傻逼 (黄立信)	14ms	7.2 MiB		199 Bytes	2023-10-15 14:00:54
AC	Randy Marsh (杨子腾)	14ms	392 KiB		204 Bytes	2022-5-20 19:03:47
AC	Randy Marsh (杨子腾)	14ms	512 KiB		204 Bytes	2022-5-20 19:03:59
AC	Ronnie	14ms	384 KiB		197 Bytes	2022-2-19 14:10:40
AC	赵泳鑫 (zhaoyongxin)	14ms	428 KiB		213 Bytes	2022-4-13 19:52:33
AC	🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕 (bro)	14ms	384 KiB		216 Bytes	2022-1-27 19:45:22
AC	huanglu	14ms	6.9 MiB		217 Bytes	2023-7-18 10:47:18
AC	朱泽晟	14ms	392 KiB		232 Bytes	2022-1-26 22:17:04
AC	wuzhenghan	14ms	384 KiB		220 Bytes	2022-12-28 21:50:06
AC	芒苒忧 (廖迦南)	14ms	384 KiB		182 Bytes	2022-1-26 20:38:38
AC	叶哲宇 (yzy)	14ms	384 KiB		224 Bytes	2023-6-2 20:53:45
AC	李彭宋代诗人 (ljy123456)	14ms	512 KiB		193 Bytes	2023-4-11 21:12:47
AC	xxteacher	14ms	392 KiB		232 Bytes	2022-3-27 15:21:05
AC	huyinuo	14ms	512 KiB		198 Bytes	2022-3-18 19:32:57
AC	文硕 (文硕1)	14ms	428 KiB		186 Bytes	2022-2-6 13:59:45
AC	孙烽轶 (sfy)	14ms	6.9 MiB	C++98	146 Bytes	2024-5-25 13:41:31
AC	蒲梓勋 (puzixun)	14ms	6.8 MiB		189 Bytes	2023-6-10 14:52:18
AC	wangzihang	14ms	436 KiB	C++	156 Bytes	2022-8-4 10:43:00
AC	Randy Marsh (杨子腾)	14ms	392 KiB		204 Bytes	2022-5-20 19:03:57
AC	靳博然 (jbr)	14ms	512 KiB		167 Bytes	2023-4-16 18:05:57
AC	wuzhenghan	14ms	384 KiB		220 Bytes	2022-12-28 21:50:06
AC	Sivan	14ms	6.6 MiB	C++98(O2)	166 Bytes	2024-7-23 16:40:15
AC	谢博文	14ms	436 KiB		263 Bytes	2022-2-19 10:59:17
AC	胡瀚文	14ms	444 KiB		155 Bytes	2022-7-18 11:32:13
AC	胡澜之 (666hlz666)	14ms	6.9 MiB	C++11	181 Bytes	2024-6-3 19:57:45
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)	14ms	512 KiB		163 Bytes	2023-5-16 19:41:21
AC	时代2校-程俊燃 (chengjunran)	15ms	440 KiB		170 Bytes	2023-4-27 18:19:59
AC	凌肯 (lingken22006)	15ms	392 KiB		178 Bytes	2022-8-7 21:59:57
AC	赵鑫宸 (xiaoxiao721)	15ms	512 KiB		230 Bytes	2022-2-26 17:23:21
AC	凌肯 (lingken22006)	15ms	392 KiB		178 Bytes	2022-8-7 21:59:56
AC	小忙果 (王昱杰)	15ms	6.9 MiB		181 Bytes	2023-7-18 8:45:27
AC	凌肯 (lingken22006)	15ms	392 KiB		178 Bytes	2022-8-7 21:59:56
AC	Randy Marsh (杨子腾)	15ms	404 KiB		204 Bytes	2022-5-20 19:03:56
AC	Randy Marsh (杨子腾)	15ms	392 KiB		204 Bytes	2022-5-20 19:03:49
AC	凌肯 (lingken22006)	15ms	392 KiB		178 Bytes	2022-8-21 22:44:50
AC	Tender. (05c05-zhou)	15ms	444 KiB		200 Bytes	2022-10-17 20:57:34
AC	李玥漪	15ms	384 KiB		207 Bytes	2022-3-20 11:19:19
AC	AC[谭赫奕] (tanheyi)	15ms	408 KiB		187 Bytes	2023-4-16 10:08:58
AC	wangruibo20xh	15ms	440 KiB		156 Bytes	2022-2-11 13:48:19
AC	Randy Marsh (杨子腾)	15ms	384 KiB		204 Bytes	2022-5-20 19:03:58
AC	ttz	15ms	432 KiB		180 Bytes	2022-2-20 9:51:32
AC	陈杰晟	15ms	512 KiB		188 Bytes	2022-3-24 15:05:31
AC	铁牛杰哥官方频道	15ms	432 KiB		174 Bytes	2022-3-9 20:10:18
AC	火爆肥肠（杨弘毅） (火爆肥肠)	15ms	512 KiB		263 Bytes	2022-3-22 21:56:56
AC	zhangyouze (张佑泽)	15ms	6.8 MiB		184 Bytes	2023-10-31 20:01:01
AC	Randy Marsh (杨子腾)	15ms	436 KiB		204 Bytes	2022-5-20 19:03:54
AC	时代二校-陈天成 (鸭缩毛巾)	15ms	496 KiB		196 Bytes	2023-3-26 22:09:18
AC	wuzhenghan	15ms	384 KiB		220 Bytes	2022-12-28 21:50:05
AC	李树崑 (lishukun)	15ms	424 KiB		214 Bytes	2022-8-21 11:00:47
AC	zhm123	15ms	424 KiB		162 Bytes	2023-3-23 15:58:18
AC	刘沄熙	15ms	436 KiB		185 Bytes	2022-3-20 11:05:07
AC	凌肯 (lingken22006)	15ms	384 KiB		178 Bytes	2022-8-21 22:44:49
AC	阮 (媚狐不吃道旁李)	15ms	7 MiB	C++98	174 Bytes	2024-5-25 16:31:49
AC	Nico	15ms	6.8 MiB		178 Bytes	2023-6-22 11:04:14
AC	wuzhenghan	15ms	384 KiB		220 Bytes	2022-12-28 21:50:06
AC	时代一校-赵彦博 (zyb)	15ms	8.1 MiB		162 Bytes	2023-8-25 16:13:00
AC	贾博涵	15ms	6.6 MiB		157 Bytes	2023-11-22 10:00:14
AC	金沙—彭智宸 (彭智宸)	15ms	6.9 MiB		145 Bytes	2023-8-15 12:20:47
AC	luoluonuoya	15ms	432 KiB		168 Bytes	2022-4-9 15:59:00
AC	chaikexu	15ms	392 KiB		165 Bytes	2022-12-2 21:52:16
AC	新壹街.曾祥睿 (zxr)	15ms	6.7 MiB		183 Bytes	2023-9-14 21:01:35
AC	何星震 (Jacob)	15ms	420 KiB		156 Bytes	2023-2-9 19:30:59
AC	邹曜丞 (13983097018)	15ms	6.9 MiB		186 Bytes	2023-7-23 17:58:45
AC	Randy Marsh (杨子腾)	15ms	392 KiB		204 Bytes	2022-5-20 19:04:01
AC	何洋名 (heyangming)	15ms	6.9 MiB		176 Bytes	2023-7-5 18:33:27
AC	xiongxinyao	15ms	440 KiB		285 Bytes	2023-4-27 19:20:56
AC	zzl	15ms	6.8 MiB		233 Bytes	2023-11-7 1:05:05
AC	坤坤荔枝小黑子 (zhonghaotian22006)	15ms	432 KiB		203 Bytes	2023-2-20 20:32:30
AC	张梓辰 (DiaoDesi屌德斯)	15ms	432 KiB		213 Bytes	2022-9-14 20:29:31
AC	余晨浩 (yuchenhao)	15ms	8.2 MiB		162 Bytes	2023-8-22 11:30:31
AC	李廷旭 (litingxu)	16ms	6.9 MiB		190 Bytes	2023-7-18 8:43:23