希蒙的数字三角形

状态	递交者	时间	内存	语言	代码	递交时间
AC	胡宸华 (huchenhua)	10ms	316 KiB		284 Bytes	2023-1-10 23:11:13
AC	200800	10ms	7 MiB		271 Bytes	2023-12-3 15:59:46
AC	无尽的想象 (谭仕高)	13ms	392 KiB		261 Bytes	2022-7-31 9:47:55
AC	Zongzi1	13ms	6.6 MiB	C++17(O2)	347 Bytes	2024-7-18 21:06:11
AC	李清城 (朱瀚文集训号)	13ms	440 KiB		274 Bytes	2023-2-2 17:18:42
AC	郭人瑀作业号	13ms	512 KiB		260 Bytes	2022-8-2 16:34:51
AC	Erin	13ms	7 MiB	C++98	254 Bytes	2024-5-28 16:22:46
AC	yanglang	13ms	392 KiB		271 Bytes	2023-3-4 15:04:07
AC	吴俊成 (wujuncheng)	13ms	512 KiB		285 Bytes	2022-7-11 22:59:42
AC	张祖名	13ms	6.9 MiB	C++98(O2)	321 Bytes	2024-6-11 22:35:28
AC	徐子恩 (Cow)	13ms	384 KiB		332 Bytes	2022-1-21 17:18:40
AC	17779	13ms	384 KiB		262 Bytes	2022-3-24 19:13:14
AC	heyi	14ms	6.8 MiB	C++98(O2)	330 Bytes	2024-8-11 11:44:44
AC	叶哲宇 (yzy)	14ms	7.2 MiB	C++11	245 Bytes	2024-5-5 20:39:58
AC	Tender. (05c05-zhou)	14ms	512 KiB		274 Bytes	2023-2-17 20:06:01
AC	三藏的痔疮 (不会玩是原罪)	14ms	392 KiB		288 Bytes	2022-1-21 12:27:21
AC	谭懿轩 (yanyixuan)	14ms	440 KiB		278 Bytes	2022-5-24 21:31:22
AC	陈杰晟	14ms	512 KiB		319 Bytes	2022-3-24 15:50:55
AC	张颢瀛	14ms	424 KiB		267 Bytes	2022-7-19 16:49:51
AC	ChongqingGroup (Donce)	14ms	7 MiB		273 Bytes	2023-12-3 16:04:45
AC	1396013295	14ms	436 KiB		503 Bytes	2022-1-22 19:07:59
AC	heyi	14ms	6.8 MiB	C++98(O2)	330 Bytes	2024-8-11 11:53:23
AC	汪致卉 (wangzh)	14ms	512 KiB		585 Bytes	2022-1-23 18:51:51
AC	xiangsiyu	14ms	512 KiB		454 Bytes	2022-6-25 19:16:40
AC	NJL (NJlL)	14ms	512 KiB		244 Bytes	2022-4-17 17:35:33
AC	冒牌陈杰晟【MOD】 (wed)	14ms	512 KiB		585 Bytes	2022-3-6 18:30:07
AC	黄梓桐 (HuangZiTong)	14ms	452 KiB		280 Bytes	2022-8-13 21:05:30
AC	时代2校-程俊燃 (chengjunran)	14ms	6.7 MiB		263 Bytes	2023-8-25 9:11:44
AC	杜俊宏	14ms	436 KiB		474 Bytes	2022-8-9 9:38:54
AC	魑归sama	14ms	436 KiB		276 Bytes	2022-7-12 16:29:33
AC	时代2校+涂彦迪 (tuyandi)	14ms	6.5 MiB		248 Bytes	2023-6-3 18:12:28
AC	詹宇航 (zyh7)	14ms	432 KiB		276 Bytes	2022-7-8 18:11:00
AC	SYC0226	14ms	436 KiB		309 Bytes	2022-3-20 13:55:33
AC	wangzihang	14ms	6.8 MiB		273 Bytes	2023-11-6 17:04:12
AC	曹埊睿 (caodirui)	14ms	428 KiB		336 Bytes	2023-5-7 15:09:46
AC	伍行念 (wuxingnian)	14ms	6.8 MiB		401 Bytes	2023-10-8 16:58:47
AC	huanglu	14ms	7 MiB		354 Bytes	2023-7-18 15:04:11
AC	林小博	15ms	432 KiB		259 Bytes	2023-2-11 9:45:51
AC	李某人	15ms	444 KiB		262 Bytes	2022-7-19 16:49:34
AC	zhm123	15ms	436 KiB		276 Bytes	2023-6-1 15:28:11
AC	Nico	15ms	6.9 MiB		272 Bytes	2023-7-18 13:14:40
AC	高彬月	15ms	7 MiB		272 Bytes	2023-12-3 15:57:21
AC	周琪渃	15ms	6.7 MiB		399 Bytes	2023-9-8 22:33:51
AC	爱琴海校区-刁钲洋 (刁钲洋)	15ms	6.7 MiB		654 Bytes	2023-9-11 14:43:59
AC	chaikexu	15ms	436 KiB		260 Bytes	2022-11-26 16:43:11
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	6.6 MiB		260 Bytes	2023-6-3 18:09:27
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	15ms	6.8 MiB		309 Bytes	2023-7-1 23:46:45
AC	朱老师 (zyp)	15ms	512 KiB		315 Bytes	2022-8-7 11:32:40
AC	BJ6180C8CTD (Fan)	15ms	6.7 MiB		309 Bytes	2023-9-9 17:17:53
AC	colin1112 (墙凌可)	16ms	6.7 MiB		304 Bytes	2023-9-4 21:19:42
AC	zhangzhimo	16ms	440 KiB		286 Bytes	2022-12-3 16:42:48
AC	稻妻第一深情 (喝酒の吟游诗人)	16ms	432 KiB		1.3 KiB	2023-3-12 0:03:26
AC	坤坤荔枝小黑子 (zhonghaotian22006)	16ms	512 KiB		260 Bytes	2022-11-26 8:22:23
AC	zhm123	16ms	6.5 MiB		276 Bytes	2023-6-3 18:00:10
AC	黄立信	16ms	6.8 MiB		348 Bytes	2023-11-8 20:48:14
AC	时代二校-焦雨齐 (Angel)	16ms	7 MiB		268 Bytes	2023-6-3 17:58:04
AC	时代2校+施皓宬 (shihaocheng)	16ms	6.5 MiB		277 Bytes	2023-6-3 18:25:45
AC	时代二校+马嘉宸 (majiachen)	16ms	6.8 MiB		267 Bytes	2023-6-3 18:08:34
AC	可爱的小花狗	16ms	6.6 MiB		272 Bytes	2023-6-3 18:03:28
AC	ganlin1	16ms	7 MiB		224 Bytes	2023-7-20 10:00:49
AC	时代二校+王吕棪 (wanglvyan)	16ms	6.3 MiB		307 Bytes	2023-6-3 17:49:22
AC	张智洋	16ms	6.5 MiB		267 Bytes	2023-6-3 18:10:28
AC	^_^ (ctc)	16ms	6.8 MiB		263 Bytes	2023-6-19 20:30:39
AC	RanHao	16ms	6.9 MiB		293 Bytes	2023-7-22 19:30:00
AC	毕浩宇 (bihaoyu)	17ms	6.3 MiB		291 Bytes	2023-6-3 17:49:09
AC	zhm123	17ms	6.3 MiB		276 Bytes	2023-6-3 17:48:31
AC	中岛敦 (黄麒瑞)	17ms	6.9 MiB		379 Bytes	2023-12-17 9:00:06
AC	时代二校-陈天成 (鸭缩毛巾)	17ms	7 MiB		238 Bytes	2023-6-3 17:55:46
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	6.9 MiB		363 Bytes	2023-8-12 17:46:04
AC	疯神芭芭脱丝 (李卓修)	18ms	440 KiB		271 Bytes	2022-11-30 15:12:14
AC	时代一校-赵彦博 (zyb)	18ms	6.9 MiB		344 Bytes	2023-8-23 19:13:36
AC	姚宏逸	19ms	6.8 MiB		273 Bytes	2022-6-1 21:50:51
AC	不怎么聪明的家伙 (贺俊楠)	20ms	6.9 MiB		385 Bytes	2023-12-10 11:36:24
AC	zyl	20ms	7.3 MiB		278 Bytes	2024-1-5 15:24:51
AC	王晨志 (wangchenzhi)	20ms	436 KiB		515 Bytes	2022-7-27 19:57:02
AC	陌生人 (涂玉龙)	21ms	7 MiB		283 Bytes	2023-12-3 15:52:11
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	25ms	7.1 MiB		330 Bytes	2023-12-7 19:04:29
AC	贾博涵	29ms	7.2 MiB		304 Bytes	2023-12-1 11:09:21
AC	希蒙 (zhengxingya)	68ms	532 KiB		428 Bytes	2024-2-24 8:40:06
AC	dyp (hhy)	68ms	540 KiB		521 Bytes	2024-3-19 19:27:51
AC	没有此人 (akm)	69ms	764 KiB		390 Bytes	2024-3-9 15:16:24
AC	jdy	72ms	768 KiB		297 Bytes	2024-3-14 16:59:51
AC	fcxin	118ms	9.4 MiB	Python 3	359 Bytes	2024-8-14 11:22:28
AC	高俊	186ms	9 MiB	Python 3	234 Bytes	2023-10-27 14:44:05
AC	cola	197ms	4 MiB	Python 3	213 Bytes	2022-12-21 18:13:46
AC	猫不理包子	199ms	9.1 MiB	Python 3	215 Bytes	2023-7-13 11:16:52
AC	kongql	210ms	3.9 MiB	Python 3	306 Bytes	2022-7-22 16:51:13
AC	梨冻亿 (wiueh)	212ms	4 MiB	Python 3	229 Bytes	2022-1-23 18:14:34
AC	Qinxiu	562ms	3.8 MiB	Python 3	235 Bytes	2024-2-13 13:21:27