求n到m的和

状态	递交者	时间	内存	语言	代码	递交时间
AC	张雯皓 (zhangwenhao)	-	7.2 MiB		180 Bytes	2023-12-23 11:40:57
AC	唐彬献	-	7.3 MiB		191 Bytes	2023-11-18 11:25:00
AC	拥抱幸福小熊(吴沛篪)	3ms	7.2 MiB		159 Bytes	2023-11-18 11:13:22
AC	scallway	4ms	7.2 MiB		148 Bytes	2023-12-14 19:54:41
AC	经常消失 (小萝卜)	5ms	416 KiB		170 Bytes	2023-4-22 13:42:37
AC	姚宏逸	5ms	420 KiB		171 Bytes	2022-12-1 19:12:43
AC	源著校区-宋昊成 (马冬梅)	5ms	384 KiB		157 Bytes	2023-4-8 18:20:22
AC	阮 (媚狐不吃道旁李)	5ms	440 KiB		142 Bytes	2023-4-25 21:29:47
AC	坤坤荔枝小黑子 (zhonghaotian22006)	5ms	512 KiB		171 Bytes	2022-12-2 9:11:31
AC	陈信羽	5ms	7 MiB	C++98	152 Bytes	2024-6-19 19:01:58
AC	heyuzhe	5ms	7 MiB	C++98	191 Bytes	2024-6-19 18:45:27
AC	77777777	5ms	6.6 MiB	C++17	129 Bytes	2024-7-24 22:24:40
AC	爱琴海校区-刁钲洋 (刁钲洋)	5ms	548 KiB		172 Bytes	2023-2-27 19:28:49
AC	胡颖彤	5ms	7 MiB	C++98	150 Bytes	2024-6-19 19:09:37
AC	RanHao	5ms	6.8 MiB		130 Bytes	2023-10-12 13:39:55
AC	张瑞博	5ms	6.9 MiB	C++11	147 Bytes	2024-6-22 23:20:20
AC	六 (江智昕)	5ms	400 KiB		185 Bytes	2023-2-9 20:22:43
AC	李树崑 (lishukun)	5ms	436 KiB		225 Bytes	2023-1-2 14:49:06
AC	樊竣熠 (lft1114)	5ms	436 KiB		164 Bytes	2023-2-8 18:02:45
AC	kongql	5ms	7.2 MiB	C++11	166 Bytes	2024-5-11 19:24:51
AC	何星震 (Jacob)	5ms	440 KiB		138 Bytes	2023-3-2 21:37:20
AC	何星震 (Jacob)	5ms	440 KiB		138 Bytes	2023-2-2 10:59:09
AC	新壹街校区-杨轩懿 (杨轩懿1)	5ms	6.7 MiB		135 Bytes	2023-8-30 11:24:42
AC	Randy Marsh (杨子腾)	5ms	384 KiB		170 Bytes	2022-12-3 14:12:39
AC	LukeDid	6ms	440 KiB		161 Bytes	2023-4-22 13:42:20
AC	黄梓轩 (huangzixuan)	6ms	436 KiB		131 Bytes	2023-4-30 9:35:06
AC	没有此人 (akm)	6ms	6.9 MiB		189 Bytes	2023-7-4 16:26:51
AC	金沙校区-先珂熠 (九转大肠)	6ms	6.7 MiB	C++20(O2)	163 Bytes	2024-8-2 16:57:14
AC	miku (阳沐珊)	6ms	6.7 MiB		130 Bytes	2023-9-19 18:04:20
AC	疯神芭芭脱丝 (李卓修)	6ms	444 KiB		164 Bytes	2023-2-27 17:32:03
AC	chaikexu	6ms	392 KiB		167 Bytes	2022-12-12 19:27:26
AC	马兴宇 (mxy01)	6ms	416 KiB		200 Bytes	2023-3-18 19:55:59
AC	huyinuo	6ms	384 KiB		214 Bytes	2022-12-1 18:40:38
AC	张月恒	6ms	6.9 MiB	C++98(O2)	144 Bytes	2024-8-22 16:56:24
AC	22029-zjs	6ms	384 KiB		195 Bytes	2023-3-24 18:46:00
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	6ms	384 KiB		193 Bytes	2023-6-3 10:33:20
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	6ms	384 KiB		194 Bytes	2023-4-8 18:10:00
AC	孙烽轶 (sfy)	6ms	432 KiB		158 Bytes	2022-12-3 16:47:06
AC	姚宏逸	6ms	428 KiB		147 Bytes	2022-12-2 11:12:04
AC	雷诺伊尔 (崔金鹏)	6ms	6.8 MiB	C++98	163 Bytes	2024-8-9 19:39:41
AC	马渝杭 (mayuhang)	6ms	440 KiB		162 Bytes	2023-5-29 17:09:05
AC	贾博涵	6ms	440 KiB		208 Bytes	2023-3-29 19:52:14
AC	杜俊宏	6ms	432 KiB		125 Bytes	2023-1-6 18:33:26
AC	何昊宇 (22016-hhy)	6ms	6.9 MiB		184 Bytes	2023-8-13 10:33:32
AC	zhangyh (张育菡)	6ms	448 KiB		125 Bytes	2023-4-29 21:01:27
AC	时代一校 - 冯隆浩 (冯隆浩)	6ms	7 MiB		150 Bytes	2023-7-18 10:56: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)	6ms	6.8 MiB		167 Bytes	2023-6-12 21:03:59
AC	SB (mfy01)	6ms	512 KiB		175 Bytes	2023-3-18 20:28:32
AC	赵沛喆	6ms	444 KiB		142 Bytes	2023-1-7 20:58:55
AC	孔思鳗	6ms	7.1 MiB		128 Bytes	2023-11-18 11:42:11
AC	黄梓桐 (HuangZiTong)	6ms	440 KiB		129 Bytes	2022-12-18 12:28:47
AC	叶哲宇 (yzy)	6ms	6.8 MiB		151 Bytes	2023-6-23 11:18:15
AC	何星震 (Jacob)	7ms	432 KiB		138 Bytes	2023-3-17 21:13:03
AC	colin1112 (墙凌可)	7ms	7.1 MiB		218 Bytes	2023-4-20 14:10:14
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	7ms	7.3 MiB		150 Bytes	2024-1-21 15:16:23
AC	周琪渃	7ms	428 KiB		185 Bytes	2023-3-9 20:14:12
AC	王晴萱	7ms	7.4 MiB		145 Bytes	2023-7-14 9:53:20
AC	一个小黑	8ms	7.1 MiB		160 Bytes	2024-1-13 18:21:05
AC	一个小黑	8ms	7.1 MiB		156 Bytes	2024-1-13 18:21:17
AC	Him (李俊熙)	8ms	7 MiB		145 Bytes	2024-1-7 16:07:13
AC	冉浩然	8ms	7.2 MiB		156 Bytes	2023-11-25 18:08:24
AC	杨馨涵	10ms	7.2 MiB		144 Bytes	2023-12-14 19:52:55
AC	王康瑞	10ms	7.2 MiB		179 Bytes	2023-11-18 10:53:58
AC	李豪 (Hao_pp)	10ms	6.8 MiB		204 Bytes	2023-11-18 0:08:32
AC	yuqihao	10ms	7.2 MiB		181 Bytes	2023-11-18 11:13:42
AC	amr (董子溪)	13ms	7.1 MiB		189 Bytes	2024-1-7 15:57:44
AC	hx6767	22ms	536 KiB	C++11(O2)	157 Bytes	2024-11-14 17:35:59
AC	明轩 (吕同学)	25ms	536 KiB		418 Bytes	2024-3-30 20:29:54
AC	什蒂尔布 (吴东航)	26ms	536 KiB		168 Bytes	2024-3-30 20:27:39
AC	新壹街校区-陈琬舒 (空空大师)	26ms	544 KiB	C++98	149 Bytes	2024-10-2 10:42:54
AC	王渝钦	26ms	532 KiB	C++11	161 Bytes	2024-10-18 22:06:31
AC	Accepted (周芷乐)	26ms	536 KiB	C++14	171 Bytes	2024-10-5 15:18:26
AC	希蒙 (zhengxingya)	27ms	532 KiB		274 Bytes	2024-2-21 16:54:00
AC	whj	27ms	552 KiB		162 Bytes	2024-1-30 14:39:25
AC	庹仕杰	28ms	532 KiB		150 Bytes	2024-1-31 19:14:22
AC	yuchenyi23017	28ms	768 KiB		172 Bytes	2024-1-28 15:48:36
AC	新壹街校区-付宇轩 (fyx)	28ms	532 KiB		122 Bytes	2024-3-30 20:27:55
AC	劳梓轩	28ms	532 KiB	C++11	158 Bytes	2024-10-2 14:28:47
AC	嘿嘿	28ms	532 KiB		191 Bytes	2024-1-30 14:38:28
AC	綰綰(HHYT)	28ms	536 KiB		153 Bytes	2024-4-9 21:00:53
AC	zhangruijie	28ms	544 KiB	C++98(O2)	150 Bytes	2024-10-17 21:25:13
AC	陈红恺 (chk)	28ms	536 KiB		165 Bytes	2023-3-18 19:48:22
AC	黄立信	29ms	532 KiB		139 Bytes	2024-3-30 20:28:09
AC	唐梓竣	29ms	532 KiB		443 Bytes	2024-3-30 20:29:09
AC	新壹街校区-冉睦阳 (冉睦阳)	29ms	532 KiB	C++98	121 Bytes	2024-10-6 12:54:46
AC	新壹街校区-老师: 黄路 (陈星宇)	29ms	532 KiB		154 Bytes	2024-3-30 20:27:58
AC	lll	29ms	768 KiB	C++98	220 Bytes	2024-10-1 10:31:19
AC	冉诩然	29ms	532 KiB	C++11	173 Bytes	2024-10-15 20:21:41
AC	cj66	30ms	764 KiB	C++11(O2)	171 Bytes	2024-11-7 16:14:45
AC	Yuan (Zongzi1)	30ms	764 KiB	C++17(O2)	176 Bytes	2024-10-30 19:58:36
AC	邹智吉	30ms	760 KiB	C++98	166 Bytes	2024-10-5 18:51:43
AC	xxx (熊辰熙)	30ms	532 KiB	C++11	151 Bytes	2024-10-6 9:39:59
AC	杨淇瑞 (杨淇瑞29)	30ms	532 KiB	C++98	200 Bytes	2024-10-19 22:41:53
AC	11451254188 (22029-mjh)	79ms	4.2 MiB	Python 3	90 Bytes	2022-12-12 18:33:14
AC	我推的乱破 (贺俊楠)	80ms	3.9 MiB	Python 3	93 Bytes	2023-1-4 14:42:41
AC	时代二校-焦雨齐 (Angel)	94ms	4 MiB	Python 3	101 Bytes	2023-1-11 21:59:37