求1~n的和

状态	递交者	时间	内存	语言	代码	递交时间
AC	时代二校-陈天成 (鸭缩毛巾)	8ms	444 KiB		172 Bytes	2023-3-18 17:41:55
AC	游智棋	8ms	7.1 MiB		161 Bytes	2023-7-18 11:37:49
AC	罗毅川 (scp-049)	8ms	432 KiB		298 Bytes	2022-10-1 15:36:56
AC	zcx	8ms	436 KiB		169 Bytes	2022-10-25 19:44:17
AC	时代二校+王吕棪 (wanglvyan)	8ms	6.9 MiB		162 Bytes	2023-7-2 15:34:52
AC	曹烜豪	8ms	448 KiB		144 Bytes	2023-3-18 19:49:18
AC	张承暄	8ms	6.9 MiB		150 Bytes	2023-7-4 10:42:07
AC	Him神	8ms	7.2 MiB		148 Bytes	2023-11-25 22:46:35
AC	guozuming	8ms	440 KiB		105 Bytes	2022-12-20 22:12:07
AC	向俊熙 (xiangjunxi23003)	8ms	7.4 MiB		160 Bytes	2023-7-10 18:54:15
AC	大马猴 (周琳竣)	8ms	6.9 MiB		156 Bytes	2023-8-10 8:53:01
AC	火焰麒麟 (李云舒)	8ms	7.3 MiB		140 Bytes	2024-1-5 18:22:51
AC	牟淳雅	8ms	6.9 MiB		179 Bytes	2023-7-20 20:19:09
AC	新壹街校区-周士杰 (zsj)	8ms	424 KiB		139 Bytes	2023-3-26 17:05:07
AC	孙烽轶 (sfy)	8ms	436 KiB		154 Bytes	2022-10-23 11:10:28
AC	刘蕤箎	8ms	6.9 MiB		104 Bytes	2023-7-23 20:00:17
AC	(金沙天街)严皓月 (严皓月)	9ms	384 KiB		138 Bytes	2022-11-3 19:24:31
AC	wanghuaiying	9ms	7 MiB		116 Bytes	2023-11-18 10:33:39
AC	高国瑞	9ms	6.9 MiB		142 Bytes	2023-8-10 11:31:44
AC	lichenrui23010	9ms	6.7 MiB		136 Bytes	2023-8-24 11:52:24
AC	李睿杰	9ms	520 KiB		112 Bytes	2022-12-12 21:35:23
AC	蒲梓勋 (puzixun)	9ms	444 KiB		169 Bytes	2022-12-16 19:13:11
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	9ms	420 KiB		165 Bytes	2022-11-11 16:53:52
AC	新壹街-王俊博 (王俊博)	9ms	6.9 MiB		136 Bytes	2023-7-11 8:21:12
AC	明哲瀚 (18580067605)	9ms	440 KiB		164 Bytes	2022-12-12 20:17:23
AC	陈于硕(我™的) (chenyu)	9ms	6.9 MiB		183 Bytes	2023-8-12 12:17:15
AC	raozheng	9ms	436 KiB		205 Bytes	2023-1-16 10:43:24
AC	林靖明	9ms	436 KiB		153 Bytes	2023-1-7 15:02:02
AC	AI创客	9ms	6.5 MiB		135 Bytes	2023-11-16 21:55:42
AC	acacac (董子溪)	10ms	7.1 MiB		181 Bytes	2024-1-17 18:48:23
AC	胡唯轶	11ms	7 MiB		149 Bytes	2024-1-6 21:17:53
AC	https://www.crazygames.com/game/merge-construct (陈诺)	11ms	7 MiB		147 Bytes	2023-12-23 20:02:36
AC	陈梓宇	11ms	7 MiB		150 Bytes	2023-12-20 20:46:22
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)	12ms	512 KiB		155 Bytes	2022-10-23 15:03:43
AC	张祖名	12ms	7 MiB		169 Bytes	2023-12-8 22:29:35
AC	冉浩然	13ms	7.2 MiB		148 Bytes	2023-11-25 18:45:16
AC	新壹街校区黄路朱启航 (zhuqihang)	15ms	7.3 MiB		149 Bytes	2024-1-21 18:18:19
AC	新壹街.曾祥睿 (zxr)	15ms	6.8 MiB		148 Bytes	2023-11-23 20:47:42
AC	maobohan	16ms	7 MiB		116 Bytes	2023-12-7 21:23:47
AC	新壹街校区-冉睦阳（想要无敌天下吗，葵花宝典有售，不要18880，只要9999） (冉睦阳)	16ms	7.1 MiB		130 Bytes	2024-1-21 18:14:06
AC	zyl	20ms	7 MiB		159 Bytes	2024-1-3 17:37:12
AC	xsm葛怀熙	22ms	532 KiB	C++98(O2)	141 Bytes	2025-4-12 18:53:54
AC	暗蛆突围 (lzh)	24ms	7 MiB		193 Bytes	2023-12-28 18:13:33
AC	龙吉先 (ljx)	25ms	592 KiB	C++11(O2)	127 Bytes	2025-6-7 15:25:05
AC	蛋仔大师（巅峰凤凰蛋，全球榜前500） (孔崇安)	29ms	764 KiB	C++98(O2)	99 Bytes	2025-4-20 11:54:18
AC	阮 (媚狐不吃道旁李)	29ms	764 KiB		141 Bytes	2024-3-9 11:00:00
AC	¿¿¿??? (李睿瞳)	29ms	532 KiB		180 Bytes	2024-2-6 16:31:17
AC	李林锜	30ms	548 KiB	C++11	183 Bytes	2025-5-24 19:01:13
AC	赵奕铭	31ms	532 KiB		151 Bytes	2024-2-18 13:57:36
AC	王康瑞	32ms	532 KiB		180 Bytes	2024-2-24 11:45:50
AC	王子昕(scallway)	32ms	532 KiB	C++11	149 Bytes	2025-4-13 14:36:04
AC	麒麟 (钟千粟)	32ms	532 KiB	C++98(O2)	134 Bytes	2025-3-22 20:27:44
AC	xsm刘梓然	32ms	764 KiB	C++98(O2)	166 Bytes	2025-4-8 21:49:45
AC	邹家民	32ms	532 KiB	C++98(O2)	143 Bytes	2025-4-13 11:51:25
AC	陈睿泽	33ms	548 KiB	C++20(O2)	151 Bytes	2025-6-1 13:48:56
AC	你干嘛 (唐世睿)	33ms	532 KiB		148 Bytes	2024-3-17 17:43:08
AC	ReFly (NKZKY)	33ms	536 KiB		190 Bytes	2024-2-1 16:55:40
AC	xsm俞子言	34ms	536 KiB	C++98(O2)	170 Bytes	2025-4-13 10:57:04
AC	xsm刘芷彤	34ms	536 KiB	C++98(O2)	180 Bytes	2025-4-13 10:53:42
AC	444444444 (唐跃元)	34ms	532 KiB		177 Bytes	2024-3-4 20:33:34
AC	yangyao	34ms	532 KiB	C++98(O2)	170 Bytes	2025-2-1 16:25:25
AC	xsm高梓豪	34ms	764 KiB	C++11(O2)	145 Bytes	2025-5-14 19:22:42
AC	算法战神 (konglinghao)	34ms	544 KiB		159 Bytes	2024-4-9 17:46:34
AC	xsm梁家畅	34ms	532 KiB	C++98(O2)	119 Bytes	2025-1-18 20:45:37
AC	邱越	34ms	532 KiB		159 Bytes	2024-2-2 20:53:27
AC	Guest	34ms	536 KiB		429 Bytes	2024-4-10 19:36:15
AC	BJ6180C8CTD (Fan)	34ms	764 KiB		162 Bytes	2024-3-8 11:23:56
AC	饶芸嫣	34ms	764 KiB	C++98	144 Bytes	2025-5-21 18:49:21
AC	赵奕铭	34ms	532 KiB		140 Bytes	2024-3-12 22:42:54
AC	新壹街—熊轩杭 (xiongxuanhang)	34ms	532 KiB		149 Bytes	2024-3-16 18:29:42
AC	zhujingen	34ms	532 KiB	C++11	143 Bytes	2025-1-19 16:32:52
AC	李煜洁1	34ms	532 KiB	C++98(O2)	141 Bytes	2025-5-6 20:15:38
AC	你个你怎么跟个一样 (钟卓劭)	35ms	764 KiB		159 Bytes	2024-2-25 14:22:35
AC	yh1	35ms	532 KiB		153 Bytes	2024-3-2 18:18:37
AC	熊辰熙	35ms	544 KiB	C++11	146 Bytes	2025-5-22 19:42:35
AC	xsm朱楷瑞	35ms	532 KiB	C++98(O2)	172 Bytes	2025-3-8 15:30:14
AC	xsm李雨涵	35ms	536 KiB	C++98(O2)	181 Bytes	2025-4-13 10:55:07
AC	裴浩钧	35ms	532 KiB	C++98	138 Bytes	2025-3-9 11:09:54
AC	黄立信是XXS (吕同学)	35ms	532 KiB		117 Bytes	2024-2-23 20:22:37
AC	lizishuo	35ms	764 KiB		175 Bytes	2024-2-20 17:37:47
AC	SXM许祖睿 (许祖睿)	35ms	532 KiB	C++17	118 Bytes	2025-2-18 20:53:31
AC	xsm胡明扬	35ms	532 KiB	C++98(O2)	429 Bytes	2025-4-13 13:56:21
AC	xsm涂书菡	35ms	532 KiB	C++98(O2)	160 Bytes	2025-3-7 16:31:08
AC	希蒙本尊 (xsm邓楚玉)	35ms	764 KiB	C++98(O2)	168 Bytes	2025-2-22 22:18:11
AC	潘弈帆	35ms	532 KiB		147 Bytes	2024-4-5 13:52:26
AC	原著校区-贺怡-李兆洋 (xsm李兆洋)	35ms	536 KiB	C++98(O2)	199 Bytes	2025-4-19 9:51:50
AC	jdy	35ms	532 KiB		157 Bytes	2024-3-6 15:14:26
AC	WYZ	35ms	544 KiB	C++11(O2)	196 Bytes	2025-5-5 15:12:39
AC	胡宸瑞	35ms	532 KiB		165 Bytes	2024-2-8 21:08:48
AC	shishen	35ms	548 KiB		155 Bytes	2024-3-15 22:43:02
AC	黄力宏	35ms	532 KiB	C++98(O2)	129 Bytes	2025-2-8 18:26:34
AC	xsm秦康晗	35ms	532 KiB	C++98(O2)	156 Bytes	2025-4-8 20:23:33
AC	蒲昊	35ms	764 KiB	C++17	143 Bytes	2025-5-17 18:31:34
AC	xsm张智涵	35ms	532 KiB	C++98(O2)	172 Bytes	2025-3-8 16:01:11
AC	严斯扬1	35ms	552 KiB	C++11	146 Bytes	2025-5-22 19:44:14
AC	xsm谢吉童	35ms	536 KiB	C++98(O2)	172 Bytes	2025-2-10 16:56:42
AC	xsm王鹤尔	35ms	532 KiB	C++98(O2)	150 Bytes	2025-3-7 17:05:29
AC	陈亦洋	35ms	532 KiB	C++17	192 Bytes	2025-4-20 17:57:55
AC	汪洋	35ms	532 KiB	C++20(O2)	203 Bytes	2025-4-11 2:21:18
AC	shiboyuan	35ms	536 KiB	C++98	148 Bytes	2025-2-28 17:31:39