输出字符三角形

状态	递交者	时间	内存	语言	代码	递交时间
AC	enen	6ms	384 KiB		199 Bytes	2023-4-8 12:15:20
AC	三藏的痔疮 (不会玩是原罪)	6ms	384 KiB		207 Bytes	2022-1-20 9:08:58
AC	低调的学霸	6ms	384 KiB		179 Bytes	2022-8-18 15:48:36
AC	icwy (zuolun)	6ms	392 KiB		175 Bytes	2022-5-14 14:06:58
AC	李树崑 (lishukun)	6ms	392 KiB		231 Bytes	2022-1-23 15:42:25
AC	郭征华第一忠实粉丝	6ms	384 KiB		187 Bytes	2022-7-22 21:19:41
AC	程舒然	6ms	6.7 MiB	C++11	175 Bytes	2024-7-17 10:14:27
AC	ylc	6ms	384 KiB		211 Bytes	2022-5-29 21:28:37
AC	22029-lyh	6ms	384 KiB		189 Bytes	2022-9-24 12:30:11
AC	钟睿煊 (zhongruixuan)	6ms	384 KiB		169 Bytes	2023-5-7 17:57:13
AC	时代校区-刘臣原 (微笑王子)	6ms	384 KiB		159 Bytes	2022-5-30 19:36:00
AC	¿¿¿??? (李睿瞳)	6ms	444 KiB		269 Bytes	2023-2-8 21:53:20
AC	钟元朗	6ms	384 KiB		158 Bytes	2022-7-10 17:26:42
AC	LUKHE (LukeHu)	6ms	384 KiB		210 Bytes	2022-1-21 20:26:35
AC	USSR slq (USSR)	6ms	392 KiB		175 Bytes	2022-5-22 15:19:54
AC	连弘锐	6ms	384 KiB		181 Bytes	2022-6-18 16:51:39
AC	张子扬	6ms	384 KiB		222 Bytes	2022-1-20 19:44:05
AC	Ruler (05c35-hjs)	6ms	392 KiB		184 Bytes	2022-5-8 8:53:33
AC	彭嘉豪 (pengjiahao)	6ms	384 KiB		177 Bytes	2022-6-26 9:08:24
AC	凌肯 (lingken22006)	6ms	384 KiB		197 Bytes	2022-5-27 20:00:56
AC	chenxiyu	6ms	392 KiB		188 Bytes	2022-9-18 11:19:25
AC	繁星 (05c35-zzm)	6ms	384 KiB		203 Bytes	2022-6-12 12:26:16
AC	黄誉翔 (黄誉翔)	6ms	384 KiB		187 Bytes	2023-5-21 11:05:32
AC	杜俊宏	6ms	384 KiB		181 Bytes	2022-3-8 19:54:07
AC	chenkerun	6ms	384 KiB		177 Bytes	2022-6-11 16:49:05
AC	南坪校区-龙浩睿 (longhaorui)	6ms	424 KiB		180 Bytes	2023-2-11 17:58:14
AC	05c05-hzy	6ms	384 KiB		184 Bytes	2022-6-5 15:31:31
AC	你爹 (郭铠嘉)	6ms	384 KiB		178 Bytes	2022-5-26 19:32:12
AC	蒋雨轩 (jiangyuxuan)	6ms	384 KiB		284 Bytes	2022-6-16 21:02:06
AC	汪筱淞	6ms	384 KiB		201 Bytes	2022-7-1 17:42:21
AC	22016-lyj	6ms	384 KiB		172 Bytes	2022-6-5 10:34:44
AC	22029-hqh	6ms	384 KiB		172 Bytes	2023-5-20 9:40:36
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	6ms	384 KiB		197 Bytes	2022-4-9 14:11:17
AC	zyq1	6ms	384 KiB		198 Bytes	2023-4-3 21:15:31
AC	右边的右边的人是SB (22016-hjy)	6ms	384 KiB		181 Bytes	2022-6-5 10:34:38
AC	侯治鋆	6ms	384 KiB		158 Bytes	2022-3-11 19:28:44
AC	hangge	6ms	384 KiB		189 Bytes	2023-5-28 9:39:24
AC	明哲瀚 (18580067605)	6ms	400 KiB		187 Bytes	2022-9-8 19:05:59
AC	wzzjnb2012	6ms	384 KiB		209 Bytes	2022-9-19 21:19:19
AC	Tang	6ms	384 KiB		183 Bytes	2022-4-27 19:20:51
AC	ymj	6ms	384 KiB		181 Bytes	2023-5-7 18:11:39
AC	疯神芭芭脱丝 (李卓修)	6ms	384 KiB		202 Bytes	2022-1-21 17:26:52
AC	姚宏逸	6ms	384 KiB		173 Bytes	2022-3-13 15:01:07
AC	支彦淇	6ms	384 KiB		162 Bytes	2022-6-18 17:08:33
AC	quzhibo	6ms	384 KiB		178 Bytes	2022-6-18 16:56:51
AC	icwy (zuolun)	6ms	384 KiB		175 Bytes	2022-4-9 13:55:07
AC	李奕霖 (liyilin233)	6ms	384 KiB		189 Bytes	2022-4-9 19:09:41
AC	彭嘉豪 (pengjiahao)	6ms	396 KiB		177 Bytes	2022-6-26 9:08:15
AC	(05c35-cyd)	6ms	384 KiB		200 Bytes	2022-3-6 15:51:13
AC	05c30-dyh	6ms	392 KiB		190 Bytes	2022-2-19 15:43:51
AC	xiejiachen	6ms	384 KiB		221 Bytes	2022-1-22 10:34:58
AC	李倾城的忠实假粉 (向熠可)	6ms	384 KiB		157 Bytes	2022-3-26 10:38:31
AC	潘光瑞 (NB牛牛大师)	6ms	384 KiB		202 Bytes	2022-8-11 11:35:30
AC	可恶的张映栩 (Johnson)	6ms	424 KiB		205 Bytes	2022-5-22 15:39:41
AC	11451254188 (22029-mjh)	6ms	384 KiB		168 Bytes	2022-9-24 12:31:13
AC	Error404sans	6ms	6.8 MiB	C++20(O2)	188 Bytes	2024-6-29 10:39:36
AC	向俊熙 (xiangjunxi23003)	6ms	384 KiB		174 Bytes	2023-2-15 16:28:58
AC	何洋名 (heyangming)	6ms	384 KiB		189 Bytes	2022-3-6 8:49:06
AC	游宏林1	6ms	392 KiB		185 Bytes	2023-5-21 19:59:29
AC	TBB (杜昊燃)	6ms	384 KiB		184 Bytes	2022-2-25 17:13:55
AC	曹雅萱	6ms	6.9 MiB	C++11	224 Bytes	2024-8-23 16:19:43
AC	牟淳雅	6ms	412 KiB		177 Bytes	2023-1-31 22:32:58
AC	时代一校-曾科智 (曾科智)	6ms	392 KiB		172 Bytes	2022-6-30 17:05:32
AC	国林泽 (guolinze)	6ms	384 KiB		297 Bytes	2022-2-18 21:56:25
AC	樊竣熠 (lft1114)	6ms	384 KiB		177 Bytes	2022-1-23 17:54:38
AC	田雨杨 (tianyuyang23010)	6ms	7.2 MiB	C++98	180 Bytes	2024-4-30 20:45:17
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	384 KiB		214 Bytes	2022-9-19 19:43:58
AC	zhoujunlin	6ms	384 KiB		170 Bytes	2022-8-18 11:51:53
AC	偽艺術家 (chenyanchi22006)	6ms	512 KiB		216 Bytes	2022-3-20 19:20:46
AC	chenxiyu	6ms	392 KiB		188 Bytes	2022-9-18 11:19:34
AC	hxb	6ms	384 KiB		198 Bytes	2023-3-5 10:43:39
AC	草\|\|草 (陈星佑)	6ms	384 KiB		198 Bytes	2022-6-5 10:57:21
AC	zhangyh (张育菡)	6ms	384 KiB		177 Bytes	2022-5-15 8:53:35
AC	小鹿	6ms	6.6 MiB	C++98(O2)	176 Bytes	2024-7-24 16:37:38
AC	yzl	6ms	384 KiB		167 Bytes	2022-4-9 19:36:04
AC	喵 (蹇心悦)	6ms	384 KiB		149 Bytes	2022-4-5 13:29:26
AC	时代一校黄誉翔 (huang)	6ms	392 KiB		177 Bytes	2022-6-30 20:25:08
AC	HIMMZXC	6ms	384 KiB		195 Bytes	2022-2-26 15:19:15
AC	05c41-hzs	6ms	384 KiB		188 Bytes	2022-3-16 18:44:41
AC	luosifu22006	6ms	384 KiB		170 Bytes	2022-5-27 20:04:02
AC	彭嘉豪 (pengjiahao)	6ms	392 KiB		177 Bytes	2022-6-26 9:08:23
AC	草\|\|草 (陈星佑)	6ms	512 KiB		179 Bytes	2022-1-25 11:31:08
AC	赵鑫宸 (xiaoxiao721)	6ms	424 KiB		215 Bytes	2022-2-19 17:35:31
AC	呵 (mohaoran)	6ms	432 KiB		172 Bytes	2022-8-27 22:31:18
AC	罗晨睿 (luochenrui)	6ms	384 KiB		169 Bytes	2022-6-26 13:25:53
AC	彭崇鑫	6ms	408 KiB		231 Bytes	2022-6-18 17:03:24
AC	低调的学霸	6ms	392 KiB		179 Bytes	2022-8-18 15:48:34
AC	张泰凌 (ztl)	6ms	392 KiB		213 Bytes	2022-1-23 15:35:16
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	6ms	392 KiB		181 Bytes	2022-5-21 13:50:41
AC	muzili	6ms	384 KiB		224 Bytes	2022-6-13 21:53:44
AC	yuzk	6ms	6.6 MiB	C++11	172 Bytes	2024-7-10 19:02:10
AC	wuzhenghan	6ms	392 KiB		183 Bytes	2022-9-4 18:19:56
AC	谭懿轩 (yanyixuan)	6ms	392 KiB		173 Bytes	2022-1-16 9:18:12
AC	张玉坚 (zhangyuian)	6ms	392 KiB		194 Bytes	2022-6-12 15:56:20
AC	陈风亦 (chenfengyi)	6ms	384 KiB		175 Bytes	2022-4-5 13:35:18
AC	宋金龙 (songjl0421)	6ms	392 KiB		192 Bytes	2022-1-22 12:07:57
AC	诸禹吉 (zhuyuji)	6ms	384 KiB		163 Bytes	2022-1-23 17:43:21
AC	彭嘉豪 (pengjiahao)	6ms	392 KiB		177 Bytes	2022-6-26 9:08:18
AC	彭嘉豪 (pengjiahao)	6ms	440 KiB		177 Bytes	2022-6-26 9:08:19
AC	李树崑 (lishukun)	6ms	436 KiB		231 Bytes	2022-4-20 19:36:30