数羊(循环结构)

状态	递交者	时间	内存	语言	代码	递交时间
AC	赵沛喆	6ms	256 KiB		178 Bytes	2022-4-1 22:55:54
AC	1396013295	7ms	256 KiB		205 Bytes	2022-1-22 18:17:50
AC	姚宏逸	7ms	264 KiB		153 Bytes	2022-5-21 11:17:45
AC	李山水	7ms	256 KiB		205 Bytes	2022-2-8 16:16:43
AC	煞笔笔	8ms	7 MiB		145 Bytes	2023-12-1 20:55:27
AC	姚宏逸	8ms	312 KiB		162 Bytes	2023-2-27 19:27:55
AC	胡宸华 (huchenhua)	9ms	304 KiB		162 Bytes	2022-11-13 8:59:57
AC	李哲 (lizhe)	12ms	400 KiB		160 Bytes	2022-8-2 16:56:29
AC	向俊熙 (xiangjunxi23003)	12ms	7.1 MiB		171 Bytes	2023-12-21 18:14:48
AC	maomao	12ms	384 KiB		242 Bytes	2022-5-25 20:23:33
AC	执剑人罗辑 (Jasson)	12ms	6.9 MiB	C++98(O2)	209 Bytes	2024-8-16 18:19:33
AC	陈秋石	12ms	384 KiB		203 Bytes	2022-3-20 12:02:12
AC	杨皓宇 (杨浩宇)	12ms	420 KiB		171 Bytes	2022-7-2 11:15:55
AC	郭人瑀 (guorenyu)	12ms	384 KiB		182 Bytes	2022-7-2 11:24:17
AC	Randy Marsh (杨子腾)	12ms	384 KiB		204 Bytes	2022-5-20 19:03:54
AC	罗伟杰 (13308275065)	12ms	436 KiB		153 Bytes	2022-7-1 13:49:45
AC	chen (peter)	13ms	384 KiB		162 Bytes	2022-7-19 14:26:26
AC	王泓涵 (whh)	13ms	404 KiB		184 Bytes	2022-7-2 11:18:15
AC	刘蕤箎	13ms	384 KiB		147 Bytes	2023-5-14 22:14:01
AC	MoonLight ( aaa)	13ms	384 KiB		223 Bytes	2022-1-22 9:45:38
AC	22016-lyj	13ms	384 KiB		157 Bytes	2023-5-16 20:49:58
AC	Randy Marsh (杨子腾)	13ms	384 KiB		204 Bytes	2022-5-20 19:03:41
AC	Randy Marsh (杨子腾)	13ms	384 KiB		204 Bytes	2022-5-20 19:03:53
AC	可爱的小花狗	13ms	392 KiB		176 Bytes	2023-4-4 20:19:41
AC	王泓涵 (whh)	13ms	384 KiB		184 Bytes	2022-7-2 11:18:10
AC	Randy Marsh (杨子腾)	13ms	384 KiB		204 Bytes	2022-5-20 19:03:43
AC	tad (OP AI)	13ms	6.9 MiB	C++11	173 Bytes	2024-7-1 21:44:39
AC	王玺懿 (wxy)	13ms	388 KiB		208 Bytes	2022-7-2 11:55:25
AC	王晨志 (wangchenzhi)	13ms	412 KiB		214 Bytes	2022-5-29 15:51:17
AC	yuhaodi	13ms	392 KiB		181 Bytes	2023-5-22 16:50:33
AC	刘智源	13ms	440 KiB		185 Bytes	2022-7-2 12:03:51
AC	Yuan (Zongzi1)	13ms	6.6 MiB	C++17(O2)	177 Bytes	2024-7-18 10:14:03
AC	傅博涛	13ms	392 KiB		150 Bytes	2022-2-27 13:32:40
AC	时代一校 - 冯隆浩 (冯隆浩)	13ms	384 KiB		157 Bytes	2022-7-2 19:29:00
AC	Guest	13ms	7.1 MiB	C++98(O2)	177 Bytes	2024-6-14 20:29:48
AC	无尽的想象 (谭仕高)	13ms	384 KiB		164 Bytes	2022-7-29 13:49:04
AC	曾龙兮	13ms	384 KiB		156 Bytes	2023-2-19 17:32:18
AC	Randy Marsh (杨子腾)	13ms	392 KiB		204 Bytes	2022-5-20 19:03:50
AC	Randy Marsh (杨子腾)	13ms	392 KiB		204 Bytes	2022-5-20 19:03:40
AC	极为的好van的 (lyq)	13ms	384 KiB		183 Bytes	2022-7-2 11:14:51
AC	Randy Marsh (杨子腾)	13ms	384 KiB		204 Bytes	2022-5-20 19:03:48
AC	王韵淮	13ms	436 KiB		166 Bytes	2022-5-22 10:09:00
AC	原著校区巫映秋 (巫映秋1a)	13ms	7 MiB	C++98	204 Bytes	2024-6-28 22:32:08
AC	霍弈丞	13ms	436 KiB		182 Bytes	2022-3-20 19:32:21
AC	cheers 戴 (daizhuorun)	13ms	384 KiB		178 Bytes	2022-4-9 16:02:24
AC	呵 (mohaoran)	13ms	384 KiB		168 Bytes	2023-2-24 17:25:52
AC	Randy Marsh (杨子腾)	13ms	384 KiB		204 Bytes	2022-5-19 19:08:21
AC	GYZ	13ms	432 KiB		185 Bytes	2022-4-20 18:08:33
AC	dmh (丁墨涵)	13ms	384 KiB		164 Bytes	2022-1-24 16:28:00
AC	曾御城（现用名） (Jason)	13ms	392 KiB		203 Bytes	2022-1-25 17:16:45
AC	Randy Marsh (杨子腾)	13ms	384 KiB		204 Bytes	2022-5-20 19:03:37
AC	凌肯 (lingken22006)	13ms	384 KiB		178 Bytes	2022-8-21 22:44:50
AC	heyi	13ms	6.8 MiB	C++98(O2)	175 Bytes	2024-8-10 10:43:24
AC	NJL (NJlL)	13ms	444 KiB		196 Bytes	2022-7-6 14:50:49
AC	Randy Marsh (杨子腾)	13ms	384 KiB		204 Bytes	2022-5-20 19:03:55
AC	朱老师 (zyp)	13ms	440 KiB		168 Bytes	2022-8-6 18:53:26
AC	黄梓桐 (HuangZiTong)	13ms	436 KiB		170 Bytes	2022-7-31 18:09:01
AC	Z.饮月君 (张皓南)	13ms	384 KiB		182 Bytes	2022-3-20 11:18:37
AC	cheers 戴 (daizhuorun)	13ms	384 KiB		178 Bytes	2022-4-9 16:00:52
AC	王泓涵 (whh)	13ms	384 KiB		184 Bytes	2022-7-2 11:18:10
AC	Erin	13ms	7 MiB	C++98	165 Bytes	2024-5-5 11:02:25
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)	13ms	384 KiB		163 Bytes	2023-5-16 19:41:44
AC	Randy Marsh (杨子腾)	13ms	384 KiB		204 Bytes	2022-5-20 19:03:58
AC	樊竣熠 (lft1114)	13ms	384 KiB		169 Bytes	2022-1-26 18:09:52
AC	谢延灏 (xeiyanhao---a handsome boy)	13ms	384 KiB		167 Bytes	2022-4-5 21:17:13
AC	Randy Marsh (杨子腾)	13ms	504 KiB		204 Bytes	2022-5-20 19:04:00
AC	任童(rentong)	13ms	448 KiB		174 Bytes	2022-9-16 16:34:28
AC	张瑞博	13ms	7.2 MiB	C++11	162 Bytes	2024-4-20 23:29:05
AC	Randy Marsh (杨子腾)	13ms	384 KiB		204 Bytes	2022-5-20 19:03:44
AC	伍芷函	13ms	384 KiB		182 Bytes	2022-3-20 13:13:45
AC	张泰凌 (ztl)	13ms	428 KiB		187 Bytes	2022-1-25 13:23:55
AC	时代一校蒋帛希 (13983392730)	13ms	384 KiB		164 Bytes	2023-2-19 17:35:44
AC	黄俊皓	13ms	512 KiB		252 Bytes	2022-4-23 10:22:48
AC	ycy	13ms	512 KiB		199 Bytes	2022-6-29 14:52:40
AC	郭人瑀作业号	13ms	444 KiB		171 Bytes	2022-8-2 15:10:08
AC	汪致卉 (wangzh)	13ms	392 KiB		184 Bytes	2022-1-22 20:19:35
AC	坤坤荔枝小黑子 (zhonghaotian22006)	13ms	512 KiB		191 Bytes	2022-8-14 12:22:18
AC	Randy Marsh (杨子腾)	13ms	384 KiB		204 Bytes	2022-5-20 19:03:56
AC	张祖名	13ms	6.9 MiB	C++98(O2)	179 Bytes	2024-6-10 21:37:54
AC	Randy Marsh (杨子腾)	13ms	384 KiB		204 Bytes	2022-5-20 19:03:45
AC	曹埊睿 (caodirui)	13ms	512 KiB		158 Bytes	2023-5-7 10:57:10
AC	longhao	13ms	384 KiB		164 Bytes	2022-1-25 9:00:05
AC	ywh	13ms	392 KiB		214 Bytes	2022-1-24 19:38:23
AC	关博源	14ms	432 KiB		170 Bytes	2023-2-18 9:51:33
AC	源著校区-宋昊成 (马冬梅)	14ms	512 KiB		200 Bytes	2023-2-25 18:25:41
AC	方子谦 (方子谦00)	14ms	388 KiB		182 Bytes	2022-3-20 12:44:24
AC	疯神芭芭脱丝 (李卓修)	14ms	432 KiB		196 Bytes	2022-1-24 16:59:22
AC	冒牌陈杰晟【MOD】 (wed)	14ms	440 KiB		135 Bytes	2022-2-28 19:11:29
AC	Randy Marsh (杨子腾)	14ms	384 KiB		204 Bytes	2022-5-20 19:04:02
AC	SYC0226	14ms	388 KiB		180 Bytes	2022-3-20 13:11:44
AC	Randy Marsh (杨子腾)	14ms	512 KiB		204 Bytes	2022-5-20 19:03:42
AC	时代二校-杨林老师-黄浦轩 (黄px)	14ms	6.9 MiB	C++11	153 Bytes	2024-8-16 14:53:55
AC	中岛敦 (黄麒瑞)	14ms	6.8 MiB		155 Bytes	2023-10-6 9:17:13
AC	Randy Marsh (杨子腾)	14ms	392 KiB		204 Bytes	2022-5-20 19:03:52
AC	Randy Marsh (杨子腾)	14ms	384 KiB		204 Bytes	2022-5-20 19:03:51
AC	Randy Marsh (杨子腾)	14ms	392 KiB		204 Bytes	2022-5-20 19:03:47
AC	李某人	14ms	384 KiB		185 Bytes	2022-1-25 18:16:37
AC	chen (peter)	14ms	512 KiB		151 Bytes	2022-7-19 14:14:55
AC	肖添宇	14ms	420 KiB		179 Bytes	2022-4-16 18:04:06
AC	我推的乱破 (贺俊楠)	14ms	384 KiB		155 Bytes	2023-3-5 18:12:44