循环练习累加

状态	递交者	时间	内存	语言	代码	递交时间
AC	汤杰尧 (05c05-tjy1)	6ms	384 KiB		214 Bytes	2022-5-9 22:03:44
AC	xiangsiyu	6ms	384 KiB		177 Bytes	2022-6-23 19:46:38
AC	王泓涵 (whh)	6ms	384 KiB		188 Bytes	2022-6-19 11:26:08
AC	右边的右边的人是SB (22016-hjy)	6ms	396 KiB		173 Bytes	2022-6-19 10:04:36
AC	张瑞博	6ms	7.2 MiB	C++11	164 Bytes	2024-4-25 22:47:15
AC	zhangyh (张育菡)	6ms	436 KiB		216 Bytes	2022-6-10 22:25:27
AC	刘政君 (lzj)	6ms	428 KiB		162 Bytes	2022-4-9 12:06:54
AC	李彭宋代诗人 (ljy123456)	6ms	384 KiB		172 Bytes	2023-4-5 20:54:22
AC	坤坤荔枝小黑子 (zhonghaotian22006)	6ms	384 KiB		243 Bytes	2022-6-23 21:26:22
AC	longhao	6ms	384 KiB		178 Bytes	2022-1-23 10:43:39
AC	张玉坚 (zhangyuian)	6ms	384 KiB		206 Bytes	2022-4-10 15:30:39
AC	许炜铭 (xuweiming)	7ms	444 KiB		201 Bytes	2023-4-17 21:33:25
AC	新壹街-王俊博 (王俊博)	7ms	7 MiB	C++98	173 Bytes	2024-6-8 14:40:19
AC	zhangheyi22006	7ms	6.7 MiB		163 Bytes	2023-9-28 22:28:35
AC	王浚西 (22016-wjx)	7ms	384 KiB		186 Bytes	2022-6-19 10:05:26
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	7ms	440 KiB		168 Bytes	2022-9-4 18:43:47
AC	chen (peter)	7ms	384 KiB		233 Bytes	2022-7-19 11:17:47
AC	呵 (mohaoran)	7ms	400 KiB		154 Bytes	2022-6-17 22:06:10
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)	7ms	384 KiB		195 Bytes	2022-11-5 11:29:19
AC	luoluonuoya	7ms	512 KiB		179 Bytes	2022-1-25 11:27:04
AC	极为的好van的 (lyq)	7ms	384 KiB		187 Bytes	2022-6-19 11:33:01
AC	谭懿轩 (yanyixuan)	7ms	428 KiB		158 Bytes	2022-2-15 14:43:49
AC	赵鑫宸 (xiaoxiao721)	7ms	384 KiB		200 Bytes	2022-2-20 22:09:50
AC	任童(rentong)	7ms	436 KiB		186 Bytes	2022-3-4 17:05:48
AC	CMG	7ms	420 KiB		206 Bytes	2022-6-6 21:07:30
AC	王浚西 (22016-wjx)	7ms	396 KiB		186 Bytes	2022-6-19 10:05:26
AC	魏楚浔 (shawn)	7ms	384 KiB		147 Bytes	2022-5-17 21:33:22
AC	王韵淮	7ms	512 KiB		199 Bytes	2022-4-17 10:10:00
AC	黄梓轩 (huangzixuan)	7ms	6.9 MiB		175 Bytes	2023-7-16 14:12:45
AC	李树崑 (lishukun)	7ms	384 KiB		171 Bytes	2022-3-26 15:26:29
AC	黄宇博 (huangyvbo)	7ms	6.9 MiB	C++11	201 Bytes	2024-6-8 15:07:28
AC	肖添宇	7ms	384 KiB		240 Bytes	2022-6-30 21:13:15
AC	laoyang	7ms	512 KiB		171 Bytes	2022-5-5 18:51:43
AC	新壹街校区-罗斤天 (罗斤天)	7ms	440 KiB		159 Bytes	2022-4-16 15:52:21
AC	dmh (丁墨涵)	7ms	384 KiB		201 Bytes	2022-1-25 20:57:41
AC	王冉燚默(重庆龙湖U城天街A馆) (wangranyimo)	7ms	6.9 MiB	C++98	164 Bytes	2024-5-20 22:35:03
AC	余彦瑞	7ms	428 KiB		221 Bytes	2023-4-9 11:56:31
AC	罗傲晴	7ms	412 KiB		221 Bytes	2023-4-5 15:49:09
AC	史继来	7ms	6.6 MiB	C++98	179 Bytes	2024-7-29 14:48:18
AC	马瑛毫001	7ms	6.9 MiB	C++98	192 Bytes	2024-6-8 15:10:51
AC	ywh	7ms	464 KiB		271 Bytes	2022-2-19 10:45:19
AC	11002	7ms	384 KiB		175 Bytes	2022-2-19 20:41:44
AC	靳博然 (jbr)	7ms	384 KiB		200 Bytes	2023-3-19 18:13:35
AC	ymh	7ms	412 KiB		148 Bytes	2022-3-26 15:32:54
AC	无尽的想象 (谭仕高)	7ms	440 KiB		161 Bytes	2022-7-15 18:34:36
AC	时代二校-焦雨齐 (Angel)	7ms	6.9 MiB	C++11	189 Bytes	2024-8-21 20:26:36
AC	Yangshenxin (𝒲𝒶𝓉𝑒𝓇)	7ms	384 KiB		202 Bytes	2022-1-23 20:10:36
AC	贾鑫豪 (Mr Sam)	7ms	384 KiB		162 Bytes	2022-3-26 15:28:04
AC	缥 (王硕2012)	7ms	384 KiB		158 Bytes	2022-11-15 19:45:33
AC	chenyifei	7ms	384 KiB		180 Bytes	2022-4-16 20:25:12
AC	chaikexu	7ms	384 KiB		207 Bytes	2022-11-18 21:50:55
AC	17779	7ms	392 KiB		206 Bytes	2022-3-8 18:49:32
AC	heyi	7ms	6.8 MiB	C++98(O2)	207 Bytes	2024-8-9 14:17:50
AC	05c35-hzh	7ms	428 KiB		184 Bytes	2022-2-13 11:55:14
AC	xxteacher	7ms	384 KiB		289 Bytes	2022-2-8 16:04:36
AC	200800	7ms	6.8 MiB		166 Bytes	2023-10-5 13:31:25
AC	Erin	7ms	7.2 MiB	C++98	166 Bytes	2024-5-2 18:04:12
AC	hulang	7ms	384 KiB		210 Bytes	2022-2-13 19:13:34
AC	ddz	7ms	424 KiB		203 Bytes	2022-3-6 18:29:39
AC	LUKHE (LukeHu)	7ms	392 KiB		282 Bytes	2022-1-25 13:34:44
AC	你爹 (郭铠嘉)	7ms	436 KiB		254 Bytes	2022-2-10 18:30:07
AC	12345	7ms	384 KiB		180 Bytes	2022-3-26 15:26:32
AC	潘光瑞 (NB牛牛大师)	7ms	428 KiB		184 Bytes	2022-8-11 11:41:19
AC	炼狱杏寿郎（的粉粉粉粉粉） (sheijiangwohh)	7ms	384 KiB		228 Bytes	2022-3-26 15:24:17
AC	🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕 (bro)	7ms	392 KiB		260 Bytes	2022-1-24 21:30:42
AC	郭人瑀作业号	7ms	440 KiB		173 Bytes	2022-8-2 14:50:02
AC	huyinuo	7ms	440 KiB		182 Bytes	2022-2-24 22:46:35
AC	JOKER (hhy)	7ms	6.8 MiB		216 Bytes	2023-10-13 14:15:34
AC	经常消失 (小萝卜)	7ms	384 KiB		186 Bytes	2022-3-26 15:27:44
AC	草\|\|草 (陈星佑)	7ms	448 KiB		141 Bytes	2022-8-19 20:12:21
AC	刘锦航	7ms	444 KiB		154 Bytes	2022-4-23 19:26:32
AC	22016-oyc	7ms	384 KiB		154 Bytes	2022-6-19 10:06:52
AC	肖添宇	7ms	448 KiB		240 Bytes	2022-6-30 21:09:53
AC	wzh1009	7ms	392 KiB		180 Bytes	2022-2-19 20:53:45
AC	爱琴海校区jzn (jzn)	7ms	384 KiB		170 Bytes	2023-5-10 20:36:53
AC	yanglinrui	7ms	392 KiB		139 Bytes	2022-3-19 20:22:27
AC	刘昊臻 (liuhaozhen)	7ms	432 KiB		217 Bytes	2023-5-17 19:52:54
AC	霍弈丞小号	7ms	384 KiB		218 Bytes	2023-4-9 12:01:20
AC	chenjunyao	7ms	6.9 MiB		224 Bytes	2023-8-20 17:22:29
AC	李林峰 (金克拉)	7ms	428 KiB		242 Bytes	2023-2-18 8:55:07
AC	zhou_1004	7ms	512 KiB		206 Bytes	2022-2-20 17:17:22
AC	zhangyouze (张佑泽)	7ms	6.8 MiB		235 Bytes	2023-10-18 22:38:28
AC	甄一阳 (22016-zyy)	7ms	6.8 MiB		197 Bytes	2023-6-10 18:02:31
AC	cainuoyan	7ms	7 MiB	C++98	146 Bytes	2024-6-16 20:07:59
AC	金锦泽 (jinjinze)	7ms	6.8 MiB		170 Bytes	2023-10-3 9:56:00
AC	朱老师 (zyp)	7ms	412 KiB		211 Bytes	2022-7-28 11:51:35
AC	zzzrrrxxx	7ms	6.9 MiB		146 Bytes	2023-7-16 14:12:07
AC	TBB (杜昊燃)	7ms	512 KiB		193 Bytes	2022-3-26 8:45:28
AC	王胤钦 (wangyinqin)	7ms	420 KiB		148 Bytes	2022-4-16 15:24:45
AC	yanxiaosong	7ms	392 KiB		173 Bytes	2022-11-5 14:13:34
AC	颜琪媛 (171)	7ms	384 KiB		171 Bytes	2022-7-13 19:47:16
AC	郑妍汐	7ms	512 KiB		251 Bytes	2022-3-1 23:25:32
AC	SMIK	7ms	392 KiB		229 Bytes	2022-1-24 12:37:21
AC	逄云皓	7ms	6.9 MiB	C++98	150 Bytes	2024-8-22 17:27:57
AC	Randy Marsh (杨子腾)	7ms	384 KiB		179 Bytes	2022-1-22 11:04:09
AC	renqiumo	7ms	436 KiB		177 Bytes	2022-2-17 19:04:29
AC	kkksc03 (彭士锋)	7ms	436 KiB		233 Bytes	2022-3-11 18:14:56
AC	可爱的小花狗	7ms	7.2 MiB	C++11	180 Bytes	2024-4-21 10:21:09
AC	黄立信	7ms	440 KiB		186 Bytes	2023-5-11 19:25:20
AC	陈红恺 (chk)	7ms	384 KiB		380 Bytes	2022-2-19 20:59:16