满足条件的数的累加2

状态	递交者	时间	内存	语言	代码	递交时间
AC	黄梓轩 (huangzixuan)	16ms	392 KiB		285 Bytes	2023-2-1 12:00:07
AC	孙烽轶 (sfy)	16ms	392 KiB		220 Bytes	2023-4-15 15:59:02
AC	邵冠铖 (shaoguancheng22031)	16ms	444 KiB		232 Bytes	2023-2-26 12:27:04
AC	dustsans (njo)	16ms	384 KiB		237 Bytes	2022-9-9 20:43:23
AC	huyinuo	16ms	392 KiB		309 Bytes	2022-5-21 13:37:17
AC	金沙—彭智宸 (彭智宸)	16ms	392 KiB		230 Bytes	2023-5-7 11:19:43
AC	吵吵小小 (超级小白)	16ms	7.2 MiB		226 Bytes	2023-10-15 15:36:39
AC	李樊駁	16ms	7.2 MiB		231 Bytes	2023-10-15 15:36:56
AC	江子墨	16ms	7 MiB	C++98	238 Bytes	2024-6-9 10:00:37
AC	疯神芭芭脱丝 (李卓修)	16ms	384 KiB		288 Bytes	2022-5-29 17:18:29
AC	孙烽轶 (sfy)	16ms	392 KiB		206 Bytes	2023-4-15 15:10:37
AC	sqmyb	16ms	384 KiB		262 Bytes	2023-4-14 19:08:33
AC	刘煜轩	16ms	384 KiB		243 Bytes	2023-5-13 17:10:46
AC	杨颂恩 (yangsongen)	16ms	6.9 MiB		343 Bytes	2023-8-17 18:20:33
AC	Randy Marsh (杨子腾)	16ms	384 KiB		306 Bytes	2022-5-29 11:52:10
AC	肖添宇	16ms	384 KiB		245 Bytes	2022-5-29 18:42:10
AC	郭益豪（帅哥） (guoyihao)	16ms	392 KiB		294 Bytes	2023-4-16 17:39:11
AC	庹仕杰	16ms	384 KiB		261 Bytes	2023-5-13 15:27:28
AC	游灵一幻 (martin)	16ms	384 KiB		232 Bytes	2023-5-7 10:57:01
AC	miku (阳沐珊)	16ms	384 KiB		263 Bytes	2022-6-30 11:01:00
AC	yanyuhan	16ms	7 MiB		245 Bytes	2023-10-15 15:35:37
AC	希蒙 (zhengxingya)	16ms	7.1 MiB	C++98	399 Bytes	2024-4-20 8:37:26
AC	朱老师 (zyp)	16ms	440 KiB		248 Bytes	2022-7-31 16:09:23
AC	靳博然 (jbr)	16ms	436 KiB		281 Bytes	2023-5-14 17:42:55
AC	吴攸 (wuyou)	16ms	7 MiB		213 Bytes	2023-10-15 15:35:34
AC	李樊駁	16ms	7.1 MiB		231 Bytes	2024-1-20 12:31:41
AC	时代2校-程俊燃 (chengjunran)	16ms	7.1 MiB		273 Bytes	2023-6-10 18:59:27
AC	缥 (王硕2012)	16ms	444 KiB		374 Bytes	2023-2-26 21:37:05
AC	德意志第三帝国 (陈远桥)	16ms	384 KiB		225 Bytes	2022-5-29 18:46:51
AC	凌肯 (lingken22006)	16ms	436 KiB		275 Bytes	2022-9-15 18:06:30
AC	王祎辰 (wangyichen)	16ms	6.7 MiB		307 Bytes	2023-8-31 10:22:50
AC	22029-zjs	16ms	384 KiB		315 Bytes	2022-12-24 9:51:04
AC	时代一校-王宥量 (wangyouliang)	16ms	392 KiB		246 Bytes	2022-11-6 15:43:50
AC	yzl2	16ms	432 KiB		255 Bytes	2023-4-22 20:50:33
AC	七叶寂照秘密主 (mohaoran)	16ms	440 KiB		225 Bytes	2023-4-9 12:00:06
AC	伍芷函	16ms	392 KiB		257 Bytes	2023-1-31 11:23:39
AC	xiangsiyu	16ms	440 KiB		246 Bytes	2022-7-3 17:43:29
AC	lihaotian	16ms	392 KiB		252 Bytes	2022-8-25 18:37:12
AC	乐瀚阳 (yuehanyang)	16ms	392 KiB		234 Bytes	2023-4-15 16:00:26
AC	杨皓淞	16ms	6.8 MiB		257 Bytes	2023-10-15 15:35:07
AC	胡澜之 (666hlz666)	16ms	6.8 MiB		311 Bytes	2023-6-27 17:21:53
AC	liuyuchen	16ms	7.1 MiB		218 Bytes	2023-10-15 15:36:01
AC	刘锦航	17ms	432 KiB		235 Bytes	2022-6-5 14:37:49
AC	刘政君 (lzj)	17ms	432 KiB		302 Bytes	2022-8-31 13:07:23
AC	scallway	17ms	6.9 MiB		218 Bytes	2023-10-15 15:35:15
AC	时代二校-焦雨齐 (Angel)	17ms	7.1 MiB		228 Bytes	2023-6-10 19:00:38
AC	scallway	17ms	6.8 MiB		218 Bytes	2023-10-15 15:35:04
AC	86想要钱 (twt)	17ms	512 KiB		290 Bytes	2022-11-27 18:19:58
AC	https://www.minecraft.net/zh-hans (王振西)	17ms	7 MiB		281 Bytes	2023-6-18 15:35:48
AC	新壹街校区--税崇峻 (税崇峻)	17ms	6.8 MiB		264 Bytes	2023-10-11 22:37:19
AC	时代1校-杨宇轩 (杨宇轩)	17ms	6.7 MiB		261 Bytes	2023-9-19 20:32:00
AC	黄誉翔 (黄誉翔)	17ms	432 KiB		267 Bytes	2023-4-7 18:41:46
AC	汤杰尧 (05c05-tjy1)	17ms	384 KiB		268 Bytes	2022-11-3 22:23:45
AC	leisixian (22029-lyh)	17ms	436 KiB		332 Bytes	2022-12-22 16:41:50
AC	ttt123	17ms	440 KiB		262 Bytes	2022-8-11 14:06:44
AC	胡瀚文	17ms	432 KiB		243 Bytes	2022-7-17 16:39:14
AC	黄px	17ms	6.8 MiB	C++11	248 Bytes	2024-8-15 16:06:22
AC	乐瀚阳 (yuehanyang)	17ms	6.9 MiB		221 Bytes	2023-8-17 21:58:40
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)	17ms	384 KiB		332 Bytes	2022-12-9 18:18:31
AC	伍芷函	17ms	444 KiB		261 Bytes	2023-5-2 16:49:50
AC	ywh	17ms	512 KiB		254 Bytes	2022-7-11 19:02:11
AC	熊奕博 (Mothefuck)	17ms	384 KiB		303 Bytes	2023-2-24 19:55:50
AC	无尽的想象 (谭仕高)	17ms	392 KiB		265 Bytes	2022-8-25 17:33:55
AC	lch (凌昌瀚)	17ms	444 KiB		261 Bytes	2022-8-4 16:08:32
AC	我是曾科智儿子 (沈小童)	17ms	384 KiB		269 Bytes	2023-5-13 16:49:43
AC	pandap&a王皓宸 (WANGHAOCHEN)	17ms	440 KiB		279 Bytes	2023-3-5 9:36:52
AC	张峻瑞	17ms	384 KiB		267 Bytes	2022-9-7 19:01:32
AC	苏晨懿	17ms	448 KiB		249 Bytes	2023-5-13 15:54:51
AC	时代一校林星宇 (lxy)	17ms	512 KiB		255 Bytes	2022-9-10 20:37:38
AC	李哲 (lizhe)	17ms	452 KiB		281 Bytes	2022-7-25 23:18:55
AC	印昭旭（412） (印昭旭)	17ms	6.7 MiB		245 Bytes	2023-6-4 10:41:57
AC	何昊宇 (22016-hhy)	17ms	384 KiB		312 Bytes	2022-12-4 9:20:07
AC	SB (mfy01)	17ms	384 KiB		285 Bytes	2022-10-1 19:06:36
AC	许嘉恩 (xje22031)	17ms	384 KiB		266 Bytes	2023-3-16 19:13:54
AC	zzy	17ms	448 KiB		805 Bytes	2023-4-8 16:26:38
AC	刘致言	17ms	440 KiB		267 Bytes	2022-9-10 9:12:47
AC	伍芷函	17ms	384 KiB		275 Bytes	2023-2-26 12:09:50
AC	杨滨郝 (ybh)	17ms	436 KiB		325 Bytes	2022-7-27 9:10:18
AC	蒲梓勋 (puzixun)	17ms	384 KiB		367 Bytes	2022-10-16 9:38:21
AC	luozixi	17ms	464 KiB		293 Bytes	2023-2-13 20:18:16
AC	时代一校-曾科智 (曾科智)	17ms	512 KiB		301 Bytes	2023-2-18 19:10:20
AC	(金沙天街)严皓月 (严皓月)	17ms	384 KiB		237 Bytes	2023-5-3 20:39:54
AC	周琪渃	17ms	384 KiB		269 Bytes	2023-3-11 18:48:17
AC	极为的好van的 (lyq)	17ms	512 KiB		234 Bytes	2023-5-12 19:46:41
AC	任希贤	17ms	452 KiB		228 Bytes	2023-5-13 15:03:36
AC	章愉霖	17ms	384 KiB		321 Bytes	2023-4-16 17:48:56
AC	22016-yzq	17ms	384 KiB		306 Bytes	2022-12-4 9:24:13
AC	谢雨贝	17ms	444 KiB		362 Bytes	2023-5-4 20:57:04
AC	jinitaimei	17ms	440 KiB		239 Bytes	2022-11-6 18:50:39
AC	luosifu22006	17ms	436 KiB		250 Bytes	2022-8-14 10:55:58
AC	纪承熙 (jcx001)	17ms	396 KiB		287 Bytes	2022-10-1 19:02:01
AC	煞笔笔	17ms	6.7 MiB		232 Bytes	2023-9-28 19:00:10
AC	胡澜之 (666hlz666)	17ms	6.7 MiB		311 Bytes	2023-6-5 21:10:10
AC	李旻轩	17ms	7.1 MiB		312 Bytes	2023-6-10 19:19:15
AC	(张洛诚)	17ms	384 KiB		320 Bytes	2023-6-3 10:48:26
AC	李金珂	17ms	440 KiB		269 Bytes	2022-8-18 14:53:25
AC	明哲瀚 (18580067605)	17ms	384 KiB		282 Bytes	2023-3-11 18:50:14
AC	彭崇鑫	17ms	392 KiB		251 Bytes	2023-4-15 15:19:49
AC	wangjun	17ms	6.6 MiB		243 Bytes	2023-11-15 11:52:48
AC	林小博	17ms	436 KiB		292 Bytes	2022-6-30 10:47:47