奇数求和

状态	递交者	时间	内存	语言	代码	递交时间
AC	时代二校-陈天成 (鸭缩毛巾)	16ms	6.9 MiB		161 Bytes	2023-7-31 22:53:34
AC	AC[谭赫奕] (tanheyi)	16ms	6.9 MiB		193 Bytes	2023-8-11 15:21:06
AC	巨珩宇	16ms	512 KiB		257 Bytes	2023-3-8 21:28:37
AC	zhangjiani	16ms	392 KiB		205 Bytes	2022-9-7 20:04:20
AC	时代1校-杨宇轩 (杨宇轩)	16ms	7.1 MiB		202 Bytes	2023-8-21 13:05:35
AC	时代1校-杨宇轩 (杨宇轩)	16ms	8.3 MiB		202 Bytes	2023-8-21 13:03:31
AC	李安桐23025	16ms	7.2 MiB		199 Bytes	2023-12-14 18:40:24
AC	吕同学是傻逼 (黄立信)	16ms	512 KiB		216 Bytes	2022-12-4 17:43:15
AC	我很6 (zjj22031)	16ms	384 KiB		256 Bytes	2022-12-2 14:08:22
AC	新壹街-曾浩坤 (曾浩坤)	16ms	6.9 MiB	C++98	175 Bytes	2024-8-21 15:59:34
AC	xuniaoyin (徐袅音)	16ms	6.9 MiB		204 Bytes	2023-7-30 11:24:35
AC	刘老师 (图书管理员)	16ms	384 KiB		203 Bytes	2022-8-25 11:58:10
AC	三差学生(尘埃蓝莓) (白佳睿)	16ms	6.9 MiB		198 Bytes	2023-7-7 20:13:05
AC	胡澜之 (666hlz666)	16ms	7.2 MiB		179 Bytes	2023-7-7 19:25:39
AC	时代一校-赵彦博 (zyb)	16ms	7.2 MiB		216 Bytes	2023-11-30 18:54:27
AC	熊海阳 (xiongxaiyang)	16ms	6.9 MiB		170 Bytes	2023-8-12 10:14:19
AC	leisixian (22029-lyh)	16ms	412 KiB		185 Bytes	2022-11-30 19:13:28
AC	你猜呀	16ms	6.8 MiB		182 Bytes	2023-6-28 15:14:09
AC	姚宏逸	17ms	432 KiB		179 Bytes	2022-10-19 14:22:52
AC	yangbinyu	17ms	388 KiB		177 Bytes	2022-9-7 20:02:28
AC	yangbinyu	17ms	384 KiB		177 Bytes	2022-9-7 20:02:25
AC	时代1校-杨宇轩 (杨宇轩)	17ms	8.3 MiB		202 Bytes	2023-8-21 13:03:45
AC	时代1校-杨宇轩 (杨宇轩)	17ms	8.2 MiB		202 Bytes	2023-8-21 13:04:37
AC	xuniaoyin (徐袅音)	17ms	6.9 MiB		204 Bytes	2023-7-30 11:24:47
AC	李彦臻	17ms	6.9 MiB		180 Bytes	2023-7-2 19:38:26
AC	没有此人 (akm)	17ms	6.9 MiB		174 Bytes	2023-7-6 16:51:11
AC	zhangxinyue	17ms	440 KiB		165 Bytes	2022-12-24 10:59:57
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	17ms	384 KiB		415 Bytes	2022-11-4 20:50:21
AC	新壹街陈科言 (cky)	17ms	7 MiB		275 Bytes	2023-7-20 14:31:14
AC	王宇桐 (我是外挂)	17ms	436 KiB		173 Bytes	2022-10-18 11:19:16
AC	陈雨泽1	17ms	7 MiB		213 Bytes	2024-1-17 10:13:20
AC	黄梓桐 (HuangZiTong)	17ms	384 KiB		167 Bytes	2022-10-25 21:08:03
AC	李林峰 (金克拉)	17ms	384 KiB		183 Bytes	2022-10-26 18:54:11
AC	huanglu	18ms	432 KiB		215 Bytes	2022-12-11 18:12:47
AC	李禹衡 (liyuheng22006)	18ms	384 KiB		172 Bytes	2022-10-25 19:19:03
AC	葛琮扬	18ms	6.9 MiB		210 Bytes	2023-7-24 15:26:01
AC	黄梓轩 (huangzixuan)	18ms	392 KiB		209 Bytes	2022-9-7 19:45:14
AC	颜梓宇	18ms	7.2 MiB		176 Bytes	2023-12-15 22:04:48
AC	新壹街校区--税崇峻 (税崇峻)	18ms	6.9 MiB		174 Bytes	2023-7-29 23:17:55
AC	CK (李弘毅)	18ms	7.1 MiB		208 Bytes	2023-11-11 17:18:10
AC	许嘉恩 (xje22031)	18ms	432 KiB		181 Bytes	2022-12-1 18:27:22
AC	黄立信是XXS (吕同学)	18ms	444 KiB		180 Bytes	2022-8-26 13:23:25
AC	muwangjunxi	19ms	384 KiB		162 Bytes	2022-10-26 18:55:42
AC	^_^ (ctc)	19ms	436 KiB		174 Bytes	2022-10-12 16:48:50
AC	张峻熙	19ms	512 KiB		206 Bytes	2022-9-18 10:02:13
AC	呵呵呵 (陈思琦)	19ms	424 KiB		163 Bytes	2022-9-7 20:00:08
AC	曹伊涵23025	19ms	7 MiB		204 Bytes	2023-12-17 15:17:58
AC	拥抱幸福小熊(吴沛篪)	19ms	7.2 MiB		182 Bytes	2023-11-18 11:12:10
AC	杨馨涵	19ms	7.1 MiB		172 Bytes	2023-12-14 20:01:24
AC	老六 (......)	19ms	440 KiB		171 Bytes	2022-11-3 19:06:42
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)	19ms	512 KiB		219 Bytes	2022-11-30 18:56:30
AC	一个小黑	19ms	7 MiB		190 Bytes	2024-1-13 18:46:24
AC	没有此人 (akm)	20ms	7 MiB		174 Bytes	2023-12-2 19:16:39
AC	陈锦成23025	20ms	7 MiB		174 Bytes	2023-12-17 15:17:56
AC	yuqihao	20ms	7.1 MiB		191 Bytes	2023-11-18 11:05:49
AC	wanghaixi xxx	21ms	7.2 MiB		180 Bytes	2023-11-30 19:42:54
AC	肖钦文 (xiaoqinwen)	21ms	384 KiB		191 Bytes	2022-8-25 11:42:10
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	21ms	384 KiB		259 Bytes	2022-11-4 20:50:35
AC	你干嘛 (唐世睿)	21ms	7.1 MiB		192 Bytes	2023-11-18 11:20:25
AC	爱琴海-马琢然 (mzr131113)	21ms	7.1 MiB		188 Bytes	2023-11-30 19:39:00
AC	ZYP (冯俊豪23025)	22ms	7 MiB		184 Bytes	2023-12-17 15:22:17
AC	徐伟宸 (徐伟宸1)	22ms	7.1 MiB		206 Bytes	2023-12-26 21:26:14
AC	邓皓天 (1234567A)	23ms	7.2 MiB		218 Bytes	2023-11-30 19:48:42
AC	贾博涵	23ms	6.8 MiB		212 Bytes	2023-11-21 21:07:49
AC	冉浩然	23ms	7 MiB		177 Bytes	2023-11-25 18:02:22
AC	唐彬献	24ms	7.2 MiB		176 Bytes	2023-11-18 11:15:23
AC	新壹街校区-陈琬舒 (空空大师)	24ms	6.8 MiB		184 Bytes	2023-11-15 20:36:54
AC	chenzhenghao	24ms	6.9 MiB		222 Bytes	2023-11-30 19:41:23
AC	坤坤荔枝小黑子 (zhonghaotian22006)	24ms	444 KiB		193 Bytes	2022-11-23 9:10:29
AC	acacac (董子溪)	25ms	7.2 MiB		237 Bytes	2024-1-7 15:57:00
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	26ms	7 MiB		196 Bytes	2023-11-11 9:22:15
AC	Noah (mwx)	26ms	7.2 MiB		211 Bytes	2023-11-25 18:35:33
AC	Microsoft (hu_moren)	26ms	6.8 MiB		625 Bytes	2023-11-30 19:36:08
AC	余彦瑞	27ms	512 KiB		180 Bytes	2022-8-25 11:37:31
AC	朱老师 (zyp)	27ms	7 MiB		180 Bytes	2023-12-17 15:16:45
AC	ywh	28ms	4.3 MiB		414 Bytes	2022-2-24 19:15:07
AC	杨朔	28ms	7.2 MiB		176 Bytes	2023-11-18 11:12:38
AC	PP (彭锦华)	28ms	7.1 MiB		185 Bytes	2023-12-17 15:22:15
AC	蒋丁非凡	29ms	7.1 MiB		159 Bytes	2023-12-3 16:54:59
AC	https://www.crazygames.com/game/merge-construct (陈诺)	30ms	7.1 MiB		168 Bytes	2024-1-2 16:59:11
AC	科比.布莱恩特 (董浩琰)	31ms	7.2 MiB		258 Bytes	2023-11-30 19:54:49
AC	wuenzi	58ms	768 KiB		404 Bytes	2024-2-22 19:26:54
AC	郝婉彤	62ms	532 KiB		215 Bytes	2024-3-2 18:41:15
AC	56HXuZiHang	62ms	532 KiB		168 Bytes	2024-4-11 20:23:33
AC	原著校区巫映秋 (巫映秋1a)	63ms	768 KiB		160 Bytes	2024-4-4 15:41:47
AC	6 (龙浩恩)	63ms	764 KiB		194 Bytes	2024-4-4 19:25:54
AC	金沙校区-先珂熠 (九转大肠)	64ms	532 KiB		254 Bytes	2024-2-24 10:27:39
AC	Guest	64ms	532 KiB	C++98(O2)	271 Bytes	2025-2-13 19:23:18
AC	张楷岩	64ms	536 KiB		198 Bytes	2024-4-6 17:57:40
AC	陈家熠	64ms	532 KiB		213 Bytes	2024-4-7 20:09:41
AC	张瑞博	64ms	540 KiB		175 Bytes	2024-4-4 18:36:15
AC	章愉霖	65ms	536 KiB		167 Bytes	2024-4-10 21:26:15
AC	许海平25	65ms	764 KiB		210 Bytes	2024-1-27 15:52:17
AC	新壹街-张博涵 (张博涵)	65ms	532 KiB		173 Bytes	2024-4-7 23:12:08
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	65ms	764 KiB		260 Bytes	2024-4-4 19:09:43
AC	源著校区陈锐霖 (13983855850)	65ms	580 KiB		154 Bytes	2024-4-7 20:58:06
AC	曹星羽	66ms	764 KiB		185 Bytes	2024-4-14 9:03:30
AC	张柏森	66ms	532 KiB	C++17	174 Bytes	2025-2-7 18:24:55
AC	whj	66ms	764 KiB		180 Bytes	2024-1-30 14:35:28
AC	曹雅萱	66ms	532 KiB		222 Bytes	2024-4-13 10:02:11