输出三角形

状态	递交者	时间	内存	语言	代码	递交时间
AC	苏嗣清	1ms	384 KiB		167 Bytes	2023-2-4 11:28:36
AC	zhangxiushi	1ms	384 KiB		183 Bytes	2022-8-26 19:58:51
AC	李彦臻	1ms	6.7 MiB		167 Bytes	2023-7-27 19:45:32
AC	苏嗣清	1ms	384 KiB		167 Bytes	2023-2-4 11:28:38
AC	王玺懿 (wxy)	1ms	384 KiB		174 Bytes	2022-7-2 11:07:17
AC	杨淇瑞 (杨淇瑞29)	1ms	384 KiB		181 Bytes	2023-4-16 13:00:40
AC	lzh1	1ms	416 KiB		195 Bytes	2022-5-25 21:32:56
AC	李禹呈	1ms	384 KiB		182 Bytes	2023-5-7 19:33:01
AC	经常消失 (小萝卜)	1ms	384 KiB		202 Bytes	2022-7-10 17:24:30
AC	任润哲	1ms	6.7 MiB		156 Bytes	2023-9-2 20:41:31
AC	鄢爱宸	1ms	7.1 MiB		251 Bytes	2023-11-4 11:12:23
AC	Accepted (周芷乐)	1ms	7.5 MiB		247 Bytes	2023-10-28 11:14:12
AC	付柏乐	1ms	384 KiB		190 Bytes	2023-5-18 21:59:10
AC	新壹街校区-陈琬舒 (空空大师)	1ms	7 MiB	C++98	178 Bytes	2024-6-12 18:30:00
AC	吴佳智 (AWM)	1ms	384 KiB		202 Bytes	2023-2-4 11:08:33
AC	gengyijun	1ms	6.9 MiB	C++98	204 Bytes	2024-4-19 20:02:43
AC	蔡宇皓	1ms	6.5 MiB		163 Bytes	2023-9-7 19:10:35
AC	张濯弋	1ms	6.6 MiB		162 Bytes	2023-9-2 16:37:06
AC	0827	1ms	384 KiB		191 Bytes	2022-9-10 19:12:49
AC	xzf	1ms	6.8 MiB		195 Bytes	2023-6-9 20:44:24
AC	SHY20091224	1ms	384 KiB		207 Bytes	2022-8-16 15:47:34
AC	洛谷：AIDczy（uid:656765） (chenzeyu)	1ms	384 KiB		168 Bytes	2022-4-9 19:03:24
AC	ddz	1ms	384 KiB		193 Bytes	2022-6-19 16:34:39
AC	吴恩子	1ms	6.7 MiB		159 Bytes	2023-9-8 18:40:10
AC	朱柯羽	1ms	384 KiB		192 Bytes	2022-5-22 17:38:32
AC	靳博然 (jbr)	1ms	384 KiB	C++	207 Bytes	2022-9-3 14:34:24
AC	极为的好van的 (lyq)	1ms	384 KiB		180 Bytes	2022-7-2 11:05:44
AC	colin1112 (墙凌可)	1ms	384 KiB		189 Bytes	2022-5-22 10:05:47
AC	A小涂	1ms	6.5 MiB		184 Bytes	2023-9-7 19:00:43
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	1ms	6.9 MiB		141 Bytes	2023-11-4 11:07:22
AC	xujialin	1ms	384 KiB		187 Bytes	2022-9-3 17:15:33
AC	Z.饮月君 (张皓南)	1ms	384 KiB		182 Bytes	2022-2-13 11:21:32
AC	司雨来 (siyulai)	1ms	392 KiB		176 Bytes	2022-5-26 22:47:40
AC	林昱霏	1ms	384 KiB		174 Bytes	2022-9-3 20:18:31
AC	南坪校区-郑力博 (zhenglibo23003)	1ms	384 KiB		158 Bytes	2023-2-4 18:08:06
AC	褚博艺	1ms	6.7 MiB		151 Bytes	2023-9-2 18:22:28
AC	zhoujunlin	1ms	384 KiB		167 Bytes	2022-8-18 11:20:46
AC	夏炜坤	1ms	6.6 MiB		178 Bytes	2023-9-2 16:39:09
AC	希蒙 (zhengxingya)	1ms	6.8 MiB		284 Bytes	2023-10-18 17:20:52
AC	陈策cc	1ms	6.5 MiB		148 Bytes	2023-8-28 16:45:14
AC	俞文博	1ms	384 KiB		175 Bytes	2022-4-9 18:58:39
AC	hulang	1ms	512 KiB		199 Bytes	2022-4-16 22:13:25
AC	赵泳鑫 (zhaoyongxin)	1ms	384 KiB		186 Bytes	2022-4-21 20:36:51
AC	陈骏逸 (chenjunyi)	1ms	384 KiB		164 Bytes	2022-7-14 20:01:28
AC	Error404sans (焦阳浩云)	1ms	6.6 MiB		178 Bytes	2023-7-11 19:21:21
AC	USSR slq (USSR)	1ms	384 KiB		190 Bytes	2022-3-25 21:05:43
AC	lch (凌昌瀚)	1ms	384 KiB		170 Bytes	2022-7-8 22:22:41
AC	王若衡 (wangruoheng)	1ms	384 KiB		195 Bytes	2023-4-14 21:32:14
AC	张颢瀛	1ms	384 KiB		178 Bytes	2022-7-22 15:15:41
AC	王星皓	1ms	384 KiB		193 Bytes	2022-2-24 20:41:44
AC	wuqi	1ms	512 KiB		203 Bytes	2022-6-14 20:10:00
AC	黄梓轩 (huangzixuan)	1ms	384 KiB		213 Bytes	2022-6-11 17:18:42
AC	马渝杭 (mayuhang)	1ms	384 KiB		178 Bytes	2023-3-6 19:14:40
AC	汪筱淞	1ms	384 KiB		178 Bytes	2022-9-3 20:17:29
AC	徐子恩 (Cow)	1ms	384 KiB		215 Bytes	2022-3-10 19:49:45
AC	wzzjnb2012	1ms	384 KiB		122 Bytes	2022-10-2 17:16:55
AC	wuqi	1ms	384 KiB		203 Bytes	2022-6-14 20:10:02
AC	baijinlin23003	1ms	384 KiB		160 Bytes	2023-2-4 18:11:58
AC	草\|\|草 (陈星佑)	1ms	384 KiB		168 Bytes	2022-4-22 18:34:02
AC	wangzihang	1ms	384 KiB		174 Bytes	2022-8-4 11:03:58
AC	曹雅萱	1ms	384 KiB		204 Bytes	2023-2-4 10:49:10
AC	王晴萱	1ms	6.6 MiB		186 Bytes	2023-8-26 10:29:32
AC	Billy52013 (李子轩)	1ms	6.7 MiB		199 Bytes	2023-8-22 17:32:04
AC	李浩然	1ms	384 KiB		176 Bytes	2023-4-29 17:42:16
AC	jjbo	1ms	6.7 MiB		188 Bytes	2023-9-2 16:52:36
AC	fsx	1ms	6.7 MiB		161 Bytes	2023-9-10 11:23:57
AC	龙思颖 (lsy)	1ms	384 KiB		215 Bytes	2023-2-18 9:49:08
AC	林正张______________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________ (姚博文)	1ms	8.2 MiB		188 Bytes	2023-5-7 15:40:22
AC	lichengrui23003	1ms	424 KiB		158 Bytes	2023-2-4 18:05:07
AC	谢博文	1ms	384 KiB		193 Bytes	2022-4-13 18:52:08
AC	zhaohaotong	1ms	384 KiB		208 Bytes	2022-5-23 19:17:52
AC	Randy Marsh (杨子腾)	1ms	384 KiB		197 Bytes	2022-5-26 18:59:42
AC	方子谦	1ms	384 KiB		219 Bytes	2022-2-15 15:50:36
AC	龙沁均 (我是S神)	1ms	384 KiB		184 Bytes	2022-5-29 17:18:33
AC	yzl	1ms	356 KiB		165 Bytes	2022-4-9 18:58:51
AC	吴沛宸	1ms	6.5 MiB		163 Bytes	2023-9-7 19:12:37
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)	1ms	392 KiB		194 Bytes	2023-5-20 11:22:29
AC	朱泽晟	1ms	384 KiB		203 Bytes	2022-8-19 16:44:53
AC	杜俊宏	1ms	384 KiB		174 Bytes	2022-6-20 19:42:34
AC	lafuzbc	1ms	384 KiB		172 Bytes	2022-7-10 13:44:03
AC	爱琴海校区jzn (jzn)	1ms	392 KiB		158 Bytes	2023-5-12 21:31:46
AC	张桐玮	1ms	384 KiB		198 Bytes	2023-2-4 11:10:34
AC	张泽宇 (ren)	1ms	384 KiB		186 Bytes	2023-5-7 15:36:59
AC	叶梓珺	1ms	6.5 MiB		162 Bytes	2023-8-31 19:37:58
AC	李禹衡 (liyuheng22006)	1ms	384 KiB		157 Bytes	2022-10-18 20:24:20
AC	LukeDid	1ms	332 KiB		213 Bytes	2023-4-22 13:38:19
AC	支彦淇	1ms	384 KiB		179 Bytes	2022-6-14 20:49:57
AC	lyc2	1ms	384 KiB		180 Bytes	2022-4-9 18:55:42
AC	贾博涵	1ms	384 KiB		190 Bytes	2023-2-4 11:05:55
AC	熊俊喆	1ms	6.7 MiB		210 Bytes	2023-9-29 16:41:06
AC	l;k (陈彬宾)	1ms	384 KiB		175 Bytes	2022-4-9 19:10:33
AC	刘智源	1ms	384 KiB		182 Bytes	2022-6-11 11:30:55
AC	罗子琪	1ms	384 KiB		188 Bytes	2022-5-23 20:53:08
AC	时代一校-曾科智 (曾科智)	1ms	384 KiB		194 Bytes	2022-9-3 20:18:05
AC	神印王座	1ms	384 KiB		218 Bytes	2022-9-24 15:10:27
AC	金沙校区-先珂熠 (九转大肠)	1ms	6.4 MiB	C++20(O2)	180 Bytes	2024-8-2 16:20:28
AC	11451254188 (22029-mjh)	1ms	384 KiB		205 Bytes	2022-11-16 13:58:54
AC	李树崑 (lishukun)	1ms	384 KiB		201 Bytes	2022-4-19 18:20:50
AC	Harley (郑浩然)	1ms	384 KiB		183 Bytes	2023-4-14 20:33:59
AC	葛琮扬	1ms	7 MiB		124 Bytes	2023-7-19 14:39:13