数字三角形

状态	递交者	时间	内存	语言	代码	递交时间
AC	赵沛喆	7ms	264 KiB		234 Bytes	2022-4-17 19:37:56
AC	姚宏逸	8ms	384 KiB		267 Bytes	2022-5-30 22:43:37
AC	wangruibo20xh	9ms	288 KiB		281 Bytes	2022-2-11 14:26:06
AC	xuniaoyin (徐袅音)	12ms	7.3 MiB		713 Bytes	2023-12-17 10:58:23
AC	maomao	13ms	384 KiB		293 Bytes	2022-6-1 18:40:12
AC	草\|\|草 (陈星佑)	14ms	384 KiB		220 Bytes	2022-6-30 9:27:00
AC	heyuzhe	14ms	6.9 MiB	C++98	252 Bytes	2024-8-16 8:50:55
AC	叶哲宇 (yzy)	14ms	7.2 MiB	C++11	296 Bytes	2024-5-5 10:31:47
AC	魑归sama	14ms	384 KiB		264 Bytes	2022-7-12 16:27:46
AC	1396013295	14ms	384 KiB		412 Bytes	2022-1-22 18:25:51
AC	胡宸华 (huchenhua)	14ms	432 KiB		260 Bytes	2022-12-1 23:20:02
AC	疯神芭芭脱丝 (李卓修)	14ms	388 KiB		203 Bytes	2022-7-14 17:07:55
AC	Zongzi1	14ms	6.7 MiB	C++17(O2)	254 Bytes	2024-7-18 16:50:39
AC	张瑞博	14ms	7.2 MiB	C++11	217 Bytes	2024-5-26 16:44:32
AC	许梓宸 (xuzichen)	14ms	6.7 MiB	C++17(O2)	236 Bytes	2024-7-17 16:23:39
AC	李山水	14ms	384 KiB		292 Bytes	2022-2-20 14:46:06
AC	草\|\|草 (陈星佑)	14ms	384 KiB		220 Bytes	2022-6-30 9:27:02
AC	赵泳鑫 (zhaoyongxin)	14ms	392 KiB		219 Bytes	2022-7-17 10:49:59
AC	王韵淮	14ms	420 KiB		261 Bytes	2022-7-16 15:17:46
AC	侯治鋆	14ms	384 KiB		274 Bytes	2022-6-10 20:44:45
AC	lch (凌昌瀚)	14ms	440 KiB		229 Bytes	2022-6-11 23:04:49
AC	huanghaoming	14ms	384 KiB		241 Bytes	2022-9-11 21:02:04
AC	詹宇航 (zyh7)	14ms	384 KiB		264 Bytes	2022-6-12 21:00:04
AC	kongql	14ms	7.1 MiB	C++11(O2)	313 Bytes	2024-5-15 14:43:51
AC	zhangyh (张育菡)	14ms	384 KiB		241 Bytes	2022-6-13 22:06:59
AC	罗竣瀚	14ms	500 KiB		203 Bytes	2023-4-8 15:04:06
AC	miku (阳沐珊)	14ms	392 KiB		246 Bytes	2022-6-30 9:27:27
AC	xiangsiyu	15ms	512 KiB		277 Bytes	2022-6-26 7:56:06
AC	21035-wyf	15ms	512 KiB		269 Bytes	2022-7-6 10:05:18
AC	yanglang	15ms	444 KiB		210 Bytes	2023-2-12 8:24:14
AC	hnd (陈皓洋)	15ms	444 KiB		230 Bytes	2023-4-8 15:01:27
AC	王晨志 (wangchenzhi)	15ms	384 KiB		306 Bytes	2022-6-18 4:41:37
AC	jianxinming	15ms	6.8 MiB	C++98	225 Bytes	2024-5-21 21:17:18
AC	张泰凌 (ztl)	15ms	384 KiB		244 Bytes	2022-2-26 10:04:14
AC	周靖松 (ZhouJS)	15ms	428 KiB		222 Bytes	2023-4-8 14:40:34
AC	张祖名	15ms	6.9 MiB	C++98(O2)	288 Bytes	2024-6-10 22:02:37
AC	heyi	15ms	6.8 MiB	C++98(O2)	261 Bytes	2024-8-10 18:42:12
AC	谢博文	15ms	384 KiB		248 Bytes	2022-2-26 10:08:02
AC	SYC0226	15ms	384 KiB		240 Bytes	2022-3-20 13:21:23
AC	赵鑫宸 (xiaoxiao721)	15ms	384 KiB		268 Bytes	2022-2-26 18:43:40
AC	曹埊睿 (caodirui)	15ms	428 KiB		281 Bytes	2023-5-7 14:41:28
AC	罗兰（漆黑襟默) (zhangxiaoci)	15ms	384 KiB		214 Bytes	2023-4-8 15:03:24
AC	曹元明	15ms	424 KiB		221 Bytes	2022-6-30 9:28:24
AC	jdy	15ms	384 KiB		225 Bytes	2022-6-30 9:27:08
AC	金沙校区-蓝祥与 (蓝祥与)	15ms	384 KiB		217 Bytes	2023-4-8 15:05:02
AC	枉哲锐	15ms	384 KiB		267 Bytes	2022-1-26 20:03:18
AC	王乐仪	15ms	384 KiB		309 Bytes	2022-2-4 17:53:21
AC	黄梓桐 (HuangZiTong)	15ms	444 KiB		230 Bytes	2022-8-3 16:46:58
AC	谢延灏 (xeiyanhao---a handsome boy)	15ms	440 KiB		253 Bytes	2022-5-15 12:35:02
AC	17779	15ms	392 KiB		209 Bytes	2022-3-17 15:54:55
AC	蓝色妖姬 (jiangpeiyu)	15ms	384 KiB		220 Bytes	2022-4-3 14:59:50
AC	林小博	15ms	384 KiB		241 Bytes	2022-6-30 9:14:46
AC	dmh (丁墨涵)	15ms	416 KiB		250 Bytes	2022-2-27 20:11:03
AC	无尽的想象 (谭仕高)	15ms	432 KiB		225 Bytes	2022-7-29 17:46:53
AC	陈杰晟	15ms	400 KiB		220 Bytes	2022-2-23 17:18:52
AC	xiongxinyao	15ms	384 KiB		239 Bytes	2022-2-26 10:08:17
AC	11451254188 (22029-mjh)	15ms	384 KiB		329 Bytes	2023-2-7 21:55:04
AC	kcs007	15ms	384 KiB		220 Bytes	2023-4-8 15:00:50
AC	MoonLight ( aaa)	15ms	388 KiB		289 Bytes	2022-1-26 20:32:43
AC	zcx	15ms	512 KiB		224 Bytes	2023-2-7 20:42:20
AC	huyinuo	15ms	512 KiB		241 Bytes	2022-3-19 8:15:38
AC	童艺涵	15ms	384 KiB		201 Bytes	2023-4-8 15:01:31
AC	汪致卉 (wangzh)	15ms	512 KiB		289 Bytes	2022-4-17 0:22:28
AC	李山水	15ms	432 KiB		292 Bytes	2022-2-20 14:46:06
AC	444444444 (唐跃元)	15ms	384 KiB		217 Bytes	2023-4-8 15:05:06
AC	程子杰 (05c41-czj)	15ms	436 KiB		221 Bytes	2022-7-27 10:49:15
AC	杜俊宏	15ms	392 KiB		238 Bytes	2022-4-26 20:45:00
AC	吴俊成 (wujuncheng)	15ms	512 KiB		329 Bytes	2022-7-11 10:27:27
AC	zhanghaoran	15ms	384 KiB		232 Bytes	2022-2-26 10:09:07
AC	杜是贤 (dushixian)	16ms	392 KiB		202 Bytes	2022-3-24 20:50:12
AC	zhm123	16ms	440 KiB		243 Bytes	2022-9-11 20:59:40
AC	zhangzixuanaa	16ms	384 KiB		243 Bytes	2023-4-8 14:14:55
AC	Erin	16ms	7.2 MiB	C++98	224 Bytes	2024-5-7 18:04:52
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)	16ms	512 KiB		313 Bytes	2023-2-5 18:22:13
AC	曾龙兮	16ms	384 KiB		230 Bytes	2023-3-26 18:02:56
AC	11111	16ms	392 KiB		274 Bytes	2022-4-10 9:47:55
AC	任童(rentong)	16ms	512 KiB		235 Bytes	2022-3-18 16:34:41
AC	新一街校区Jason_LuoYouZheng (罗友峥)	16ms	392 KiB		212 Bytes	2022-2-26 10:08:52
AC	胡程禹	16ms	7 MiB	C++98	294 Bytes	2024-8-23 18:28:27
AC	zzl	16ms	6.8 MiB		219 Bytes	2023-11-7 1:10:26
AC	huanglu	16ms	6.9 MiB		255 Bytes	2023-7-18 11:21:11
AC	伍行念 (wuxingnian)	16ms	6.8 MiB		316 Bytes	2023-10-7 18:24:44
AC	_PXY_	16ms	640 KiB		270 Bytes	2022-1-24 15:36:13
AC	昌文迪 (05c05-cwd2)	16ms	440 KiB		240 Bytes	2022-7-27 8:21:29
AC	yuhaodi	16ms	512 KiB		291 Bytes	2023-5-15 17:51:03
AC	朱老师 (zyp)	16ms	392 KiB		272 Bytes	2022-8-7 10:32:19
AC	芒苒忧 (廖迦南)	16ms	512 KiB		270 Bytes	2022-8-27 15:56:56
AC	黄立信	16ms	6.8 MiB		272 Bytes	2023-10-17 20:27:06
AC	付博plus	16ms	512 KiB		215 Bytes	2023-4-8 15:02:26
AC	谭懿轩 (yanyixuan)	16ms	436 KiB		214 Bytes	2022-2-26 15:22:03
AC	冒牌陈杰晟【MOD】 (wed)	16ms	440 KiB		356 Bytes	2022-3-6 15:30:54
AC	唐九九 (121)	16ms	440 KiB		274 Bytes	2022-4-10 9:47:17
AC	ywh	16ms	420 KiB		281 Bytes	2022-2-26 10:05:22
AC	郑驭辰	16ms	7.1 MiB		223 Bytes	2023-12-20 19:17:29
AC	秦子越 (13883322087)	16ms	512 KiB		222 Bytes	2022-2-18 18:47:59
AC	罗晨睿 (luochenrui)	16ms	444 KiB		235 Bytes	2022-6-29 13:31:03
AC	wuqilin	16ms	440 KiB		223 Bytes	2023-4-1 9:55:57
AC	蒲梓勋 (puzixun)	16ms	6.8 MiB		271 Bytes	2023-6-10 14:59:19
AC	wangzihang	17ms	6.7 MiB		334 Bytes	2023-8-29 11:27:41
AC	周琪渃	17ms	512 KiB		236 Bytes	2023-1-4 22:20:02