奇数求和

状态	递交者	时间	内存	语言	代码	递交时间
AC	My name is Man (钟卓劭)	66ms	548 KiB		179 Bytes	2024-3-17 13:48:23
AC	颜梓宇	67ms	764 KiB		176 Bytes	2024-4-6 15:25:33
AC	wangmulai	67ms	540 KiB		186 Bytes	2024-2-9 18:11:36
AC	金沙校区-先珂熠 (九转大肠)	67ms	764 KiB		179 Bytes	2024-4-7 20:25:48
AC	高敏睿	67ms	552 KiB		153 Bytes	2024-4-6 19:29:22
AC	郑隽霖	67ms	532 KiB		179 Bytes	2024-2-16 11:22:10
AC	李浩然	67ms	768 KiB		175 Bytes	2024-4-4 14:50:29
AC	新壹街校区-冉睦阳 (冉睦阳)	67ms	764 KiB		154 Bytes	2024-4-6 18:44:10
AC	雷承翰 (雷承翰lch)	67ms	536 KiB		166 Bytes	2024-4-13 17:30:26
AC	yuchenyi23017	67ms	536 KiB		191 Bytes	2024-1-28 13:32:13
AC	金沙校区-蓝祥与 (蓝祥与)	67ms	548 KiB		201 Bytes	2024-2-24 10:18:41
AC	邵清泉	67ms	532 KiB		225 Bytes	2024-4-5 15:57:36
AC	朱老师 (zyp)	67ms	548 KiB		227 Bytes	2024-3-15 15:38:44
AC	赵奕铭	67ms	552 KiB		173 Bytes	2024-2-7 17:04:18
AC	金沙校区-先珂熠 (九转大肠)	67ms	532 KiB		198 Bytes	2024-4-7 20:07:01
AC	zzzrrrxxx	68ms	548 KiB		205 Bytes	2024-4-6 15:43:36
AC	朱老师 (zyp)	68ms	540 KiB		246 Bytes	2024-3-15 16:30:32
AC	田世瑞	68ms	764 KiB		277 Bytes	2024-4-4 16:04:34
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	68ms	536 KiB		298 Bytes	2024-3-23 14:56:08
AC	王祎辰 (wangyichen)	68ms	536 KiB		250 Bytes	2024-4-6 16:37:12
AC	胡云杰	68ms	532 KiB		157 Bytes	2024-4-13 10:53:07
AC	love GanYu (爱搞笑的张浩宇)	68ms	532 KiB		232 Bytes	2024-4-14 10:11:30
AC	dyp (hhy)	68ms	764 KiB		172 Bytes	2024-1-27 20:13:19
AC	时代一校石博文 (shibowen)	68ms	532 KiB		235 Bytes	2024-2-15 21:29:24
AC	wrz	68ms	532 KiB		183 Bytes	2024-3-8 15:36:09
AC	yyds (杨骐嘉)	69ms	536 KiB		195 Bytes	2024-4-11 18:57:46
AC	金沙校区-先珂熠 (九转大肠)	69ms	764 KiB		198 Bytes	2024-2-23 20:28:19
AC	金沙校区-先珂熠 (九转大肠)	69ms	764 KiB		198 Bytes	2024-3-5 21:56:08
AC	潘弈帆	69ms	764 KiB		244 Bytes	2024-4-5 14:31:08
AC	jdy	69ms	764 KiB		186 Bytes	2024-3-6 15:14:49
AC	周浩楠 (开朗的周好难)	69ms	536 KiB		269 Bytes	2024-4-5 16:26:05
AC	贾易征	70ms	532 KiB		170 Bytes	2024-4-6 16:51:19
AC	曹星羽	70ms	536 KiB		185 Bytes	2024-3-2 12:52:24
AC	wushengyue	70ms	536 KiB	C++17	202 Bytes	2024-9-1 11:23:28
AC	徐绅博	70ms	768 KiB		164 Bytes	2024-4-6 20:49:19
AC	zhangyouze (张佑泽)	70ms	768 KiB		199 Bytes	2024-4-4 19:52:25
AC	嘿嘿	70ms	532 KiB		202 Bytes	2024-1-30 14:27:40
AC	崔欧辰	70ms	764 KiB	C++11	229 Bytes	2024-9-9 15:23:31
AC	杨博文05	72ms	768 KiB	C++98	216 Bytes	2024-9-10 17:16:27
AC	郑尧 (zhengyao)	72ms	764 KiB		167 Bytes	2024-4-13 9:23:48
AC	杨镇宇	74ms	764 KiB		192 Bytes	2024-3-3 19:28:10
AC	余sy	116ms	9.3 MiB	Python 3	125 Bytes	2024-5-12 16:27:08
AC	penghy	117ms	9.3 MiB	Python 3	162 Bytes	2024-5-12 16:21:24
AC	盗号者该死 (陶欣垚)	117ms	9.4 MiB	Python 3	128 Bytes	2024-5-12 20:10:45
AC	曾yc	120ms	9.4 MiB	Python 3	125 Bytes	2024-5-12 16:28:20
AC	肖艺勋2	122ms	9.4 MiB	Python 3	129 Bytes	2024-5-12 20:05:29
AC	11451254188 (22029-mjh)	123ms	9.4 MiB	Python 3	104 Bytes	2024-4-25 19:36:58
AC	伍jc	123ms	9.4 MiB	Python 3	107 Bytes	2024-5-12 16:27:12
AC	fcxin	126ms	9.4 MiB	Python 3	134 Bytes	2024-8-9 11:38:08
AC	李yc	126ms	9.3 MiB	Python 3	130 Bytes	2024-5-12 16:25:37
AC	李yz	131ms	9.4 MiB	Python 3	118 Bytes	2024-5-12 16:27:35
AC	许炜铭 (xuweiming)	181ms	9 MiB	Python 3	100 Bytes	2023-7-13 19:16:53
AC	可爱酱 (张可忻)	184ms	9.1 MiB	Python 3	106 Bytes	2023-9-26 19:58:38
AC	高俊	185ms	9.1 MiB	Python 3	110 Bytes	2023-10-18 14:30:43
AC	安闵煜 (anzai)	188ms	9 MiB	Python 3	107 Bytes	2023-11-8 9:50:30
AC	19598	188ms	9 MiB	Python 3	104 Bytes	2023-8-13 16:55:11
AC	帅气的小马儿	190ms	9.1 MiB	Python 3	125 Bytes	2023-6-23 17:35:29
AC	中岛敦 (黄麒瑞)	191ms	9 MiB	Python 3	108 Bytes	2023-10-2 12:46:26
AC	谭红中 (不知道)	196ms	3.9 MiB	Python 3	92 Bytes	2022-3-28 18:14:29
AC	南坪协信校区-叶钟阳 (yezhongyang23010)	196ms	3.9 MiB	Python 3	98 Bytes	2023-5-10 19:21:09
AC	zyp (wangjunling23010)	197ms	3.9 MiB	Python 3	137 Bytes	2023-5-10 19:18:57
AC	sb (linjiayu23010)	198ms	3.9 MiB	Python 3	118 Bytes	2023-5-10 19:20:22
AC	xxteacher	203ms	9 MiB	Python 3	112 Bytes	2023-7-20 17:01:17
AC	114514 (wangjunling)	203ms	3.9 MiB	Python 3	116 Bytes	2023-2-10 20:40:26
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	204ms	3.9 MiB	Python 3	111 Bytes	2022-4-23 20:35:11
AC	冉浩然	204ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:42:38
AC	南坪校区-龙浩睿 (longhaorui)	204ms	3.9 MiB	Python 3	126 Bytes	2023-5-10 19:21:36
AC	cola	205ms	4 MiB	Python 3	109 Bytes	2022-12-16 16:29:11
AC	猫不理包子	205ms	9.1 MiB	Python 3	101 Bytes	2023-7-2 17:50:21
AC	kongql	205ms	3.9 MiB	Python 3	100 Bytes	2022-7-21 14:07:58
AC	爱琴海校区-刁钲洋 (刁钲洋)	206ms	3.9 MiB	Python 3	117 Bytes	2022-3-8 20:23:23
AC	李 (李恺伦)	206ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:41
AC	heantong	207ms	3.9 MiB	Python 3	113 Bytes	2023-2-10 20:48:40
AC	11451254188 (22029-mjh)	207ms	3.9 MiB	Python 3	110 Bytes	2023-5-10 19:21:51
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)	207ms	3.9 MiB	Python 3	118 Bytes	2023-5-10 19:18:07
AC	不怎么聪明的家伙 (贺俊楠)	208ms	4 MiB	Python 3	108 Bytes	2023-4-16 13:20:59
AC	龙吉先 (ljx)	208ms	3.9 MiB	Python 3	105 Bytes	2023-5-10 19:27:13
AC	梨冻亿 (wiueh)	208ms	3.9 MiB	Python 3	110 Bytes	2022-1-23 18:02:59
AC	张梓浩 (zhangzihao)	208ms	3.9 MiB	Python 3	128 Bytes	2022-12-3 11:33:27
AC	李 (李恺伦)	209ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:45
AC	11111	210ms	3.9 MiB	Python 3	120 Bytes	2022-1-27 16:25:43
AC	tianyuyang	210ms	3.9 MiB	Python 3	114 Bytes	2023-2-10 20:48:24
AC	李 (李恺伦)	210ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:36
AC	李 (李恺伦)	210ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:41
AC	majinhui	211ms	3.9 MiB	Python 3	104 Bytes	2022-6-8 20:57:07
AC	龙吉先 (ljx)	211ms	3.9 MiB	Python 3	105 Bytes	2023-5-10 19:27:09
AC	李 (李恺伦)	211ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:43
AC	李 (李恺伦)	211ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:44
AC	龙吉先 (ljx)	212ms	3.9 MiB	Python 3	105 Bytes	2023-5-10 19:31:21
AC	tianyufan21039	212ms	3.9 MiB	Python 3	115 Bytes	2023-2-10 20:46:16
AC	李 (李恺伦)	212ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:45
AC	李 (李恺伦)	213ms	4 MiB	Python 3	104 Bytes	2023-5-28 18:43:40
AC	李 (李恺伦)	213ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:45
AC	南坪校区-郑力博 (zhenglibo23003)	213ms	3.9 MiB	Python 3	108 Bytes	2023-5-10 19:23:23
AC	李 (李恺伦)	213ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:43
AC	李 (李恺伦)	214ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:44
AC	11451254188 (22029-mjh)	214ms	3.9 MiB	Python 3	110 Bytes	2023-5-10 19:17:58
AC	李 (李恺伦)	214ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:42
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	214ms	3.9 MiB	Python 3	111 Bytes	2022-4-23 16:07:48
AC	李 (李恺伦)	216ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:39