打印三角形

状态	递交者	时间	内存	语言	代码	递交时间
AC	胡宸瑞	1ms	6.7 MiB		186 Bytes	2023-9-1 20:04:55
AC	许桉铭	1ms	6.7 MiB		193 Bytes	2023-9-16 17:06:46
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	1ms	384 KiB		219 Bytes	2022-3-26 15:00:32
AC	123 (刘侑昊)	1ms	384 KiB		238 Bytes	2023-4-14 21:35:31
AC	lafuzbc	1ms	384 KiB		192 Bytes	2022-7-10 13:42:57
AC	86想要钱 (twt)	1ms	384 KiB		222 Bytes	2022-8-18 11:19:00
AC	RALY染妗(TINHOIYUI)	1ms	6.8 MiB		225 Bytes	2023-10-14 14:45:01
AC	xzf	1ms	6.6 MiB		231 Bytes	2023-6-9 20:40:29
AC	古煦涵	1ms	6.7 MiB		181 Bytes	2023-9-10 15:15:03
AC	wuqi	1ms	384 KiB		223 Bytes	2022-6-14 20:04:48
AC	RALY染妗(TINHOIYUI)	1ms	6.8 MiB		225 Bytes	2023-10-14 14:44:56
AC	鄢爱宸	1ms	6.9 MiB		271 Bytes	2023-11-4 11:10:11
AC	谢润轩	1ms	384 KiB		297 Bytes	2023-2-4 10:53:52
AC	林正张______________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________ (姚博文)	1ms	8.2 MiB		208 Bytes	2023-5-7 15:37:04
AC	时代一校-段老师：李云舒 (李云舒)	1ms	6.7 MiB		188 Bytes	2023-9-1 20:05:42
AC	杜俊宏	1ms	384 KiB		194 Bytes	2022-6-20 19:45:08
AC	一个小黑	1ms	6.7 MiB		175 Bytes	2023-9-1 20:06:47
AC	金沙校区-孟熙轲 (mengxike)	1ms	6.8 MiB		181 Bytes	2023-9-2 11:00:26
AC	刘梦泉	1ms	6.7 MiB		206 Bytes	2023-9-1 20:04:18
AC	时代一校-王宥量 (wangyouliang)	1ms	384 KiB		221 Bytes	2022-9-11 21:18:55
AC	明轩 (吕同学)	1ms	384 KiB		205 Bytes	2022-5-21 22:34:41
AC	余彦瑞	1ms	384 KiB		183 Bytes	2022-2-13 11:14:43
AC	呵呵呵 (陈思琦)	1ms	384 KiB		203 Bytes	2022-6-11 17:21:59
AC	quzhibo	1ms	392 KiB		198 Bytes	2022-6-12 17:50:18
AC	CWj	1ms	384 KiB		219 Bytes	2023-2-4 11:06:27
AC	yiqiuyu23003	1ms	384 KiB		168 Bytes	2023-2-4 18:04:54
AC	吴佳智 (AWM)	1ms	392 KiB		222 Bytes	2023-2-4 11:06:36
AC	卢永辉	1ms	6.5 MiB		189 Bytes	2023-9-10 15:21:34
AC	段淏泷 (林皓轩)	1ms	6.7 MiB		250 Bytes	2023-9-10 15:22:04
AC	张玉坚 (zhangyuian)	1ms	384 KiB		235 Bytes	2022-6-12 15:53:08
AC	陈于硕(我™的) (chenyu)	1ms	392 KiB		200 Bytes	2023-3-4 11:12:16
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	384 KiB		214 Bytes	2023-5-20 11:21:43
AC	时代二校-王盼兮 (wangpanxi)	1ms	376 KiB		207 Bytes	2023-4-29 9:22:36
AC	Accepted (周芷乐)	1ms	7.1 MiB		204 Bytes	2023-11-4 11:10:56
AC	食不食油饼（点主页康康） (Nemo)	1ms	384 KiB		235 Bytes	2022-5-23 20:28:34
AC	dengbowen	1ms	6.7 MiB		204 Bytes	2023-8-26 20:01:27
AC	李彦臻	1ms	6.7 MiB		191 Bytes	2023-7-27 19:43:58
AC	高敏睿	1ms	384 KiB		214 Bytes	2023-2-4 10:48:02
AC	zvt_132 (任子轩)	1ms	6.7 MiB		189 Bytes	2023-8-30 9:46:12
AC	liuyuanxi23017	1ms	6.5 MiB		188 Bytes	2023-8-26 20:11:46
AC	TJW唐嘉文	1ms	384 KiB		211 Bytes	2022-4-28 18:57:32
AC	林叙锦	1ms	344 KiB		209 Bytes	2022-6-30 15:04:15
AC	益布响完辣 (黄靖益1)	1ms	384 KiB		200 Bytes	2023-4-14 21:55:37
AC	刘洋	1ms	6.7 MiB		201 Bytes	2023-9-1 20:04:35
AC	lafuzbc	1ms	384 KiB		192 Bytes	2022-7-10 13:43:00
AC	wuqi	1ms	384 KiB		223 Bytes	2022-6-14 20:04:46
AC	吴佳智 (AWM)	1ms	384 KiB		222 Bytes	2023-2-4 11:06:35
AC	lzh1	1ms	384 KiB		216 Bytes	2022-5-25 21:31:40
AC	liangyuntian23003	1ms	384 KiB		179 Bytes	2023-2-4 18:06:31
AC	LukeDid	1ms	384 KiB		233 Bytes	2023-4-22 13:37:51
AC	曹雅萱	1ms	368 KiB		224 Bytes	2023-2-4 10:48:24
AC	阚一鸣	1ms	384 KiB		220 Bytes	2022-10-23 14:43:11
AC	叶梓珺	1ms	6.7 MiB		189 Bytes	2023-8-23 11:10:22
AC	赵泳鑫 (zhaoyongxin)	1ms	384 KiB		202 Bytes	2022-4-3 9:28:35
AC	1+1=2 (曹瀚文)	1ms	6.6 MiB		236 Bytes	2023-7-4 19:34:47
AC	old8	1ms	384 KiB		221 Bytes	2022-4-9 19:08:13
AC	王子睿	1ms	7 MiB	C++98	118 Bytes	2024-8-24 16:06:07
AC	technoblade	1ms	6.5 MiB		185 Bytes	2023-8-27 10:09:16
AC	刘泽21	1ms	384 KiB		204 Bytes	2023-4-4 17:57:29
AC	汤杰尧 (05c05-tjy1)	1ms	384 KiB		237 Bytes	2022-8-8 20:29:20
AC	05c35-hhw	1ms	384 KiB		207 Bytes	2022-8-18 13:48:16
AC	zzl	1ms	384 KiB		219 Bytes	2023-1-3 16:43:13
AC	范老师	1ms	384 KiB		219 Bytes	2022-10-5 15:34:53
AC	U城校区毕悦志 (byz)	1ms	376 KiB		219 Bytes	2023-2-5 16:54:31
AC	qwertyuiop	1ms	384 KiB		209 Bytes	2022-2-18 21:24:28
AC	蒋一彰	1ms	384 KiB		203 Bytes	2022-4-9 19:44:07
AC	周琪渃	1ms	384 KiB		341 Bytes	2022-12-4 13:13:52
AC	姚宏逸	1ms	384 KiB		198 Bytes	2022-2-24 20:13:25
AC	ddz	1ms	384 KiB		218 Bytes	2022-6-19 16:33:17
AC	enen	1ms	384 KiB		227 Bytes	2023-4-14 16:56:46
AC	唐梓竣	1ms	384 KiB		182 Bytes	2022-5-24 20:40:55
AC	罗伟宸2	1ms	384 KiB		203 Bytes	2022-6-30 14:58:25
AC	何煜琦	1ms	6.7 MiB		195 Bytes	2023-8-23 10:55:24
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	1ms	6.9 MiB		161 Bytes	2023-11-4 11:03:21
AC	龙湖源著校区-王子涵 (王子涵)	1ms	384 KiB		194 Bytes	2022-9-3 17:18:28
AC	Jack	1ms	384 KiB		220 Bytes	2022-5-22 15:54:03
AC	cxk	1ms	384 KiB		210 Bytes	2023-5-7 15:39:21
AC	张泰凌 (ztl)	1ms	384 KiB		239 Bytes	2022-2-19 10:13:48
AC	袁铭鸿	1ms	384 KiB		200 Bytes	2023-2-5 17:47:19
AC	吴佳智 (AWM)	1ms	384 KiB		222 Bytes	2023-2-4 11:06:35
AC	吴佳智 (AWM)	1ms	384 KiB		222 Bytes	2023-2-4 11:06:35
AC	(张洛诚)	1ms	384 KiB		230 Bytes	2022-5-23 21:30:01
AC	时代2校+施皓宬 (shihaocheng)	1ms	384 KiB		221 Bytes	2023-2-18 15:28:31
AC	江政含	1ms	6.6 MiB		194 Bytes	2023-7-4 19:32:37
AC	冯锦汶	1ms	6.7 MiB		160 Bytes	2023-9-24 17:30:03
AC	Mr_D	1ms	6.5 MiB		203 Bytes	2023-9-16 17:05:15
AC	时代一校-段老师：李云舒 (李云舒)	1ms	6.5 MiB		188 Bytes	2023-9-1 20:03:27
AC	龙湖源著校区-王子涵 (王子涵)	1ms	384 KiB		194 Bytes	2022-9-3 17:18:30
AC	刘智源	1ms	384 KiB		212 Bytes	2022-6-11 11:28:32
AC	CK (李弘毅)	1ms	384 KiB		202 Bytes	2022-6-23 17:52:03
AC	Tender. (05c05-zhou)	1ms	384 KiB		196 Bytes	2023-3-5 18:34:52
AC	源著校区-刘洋-付柏乐 (付柏乐)	1ms	384 KiB		221 Bytes	2023-5-18 21:53:15
AC	yiqiuyu23003	1ms	384 KiB		168 Bytes	2023-2-4 18:03:51
AC	代老师02号	1ms	6.5 MiB		183 Bytes	2023-9-7 16:59:38
AC	千千万万	1ms	384 KiB		198 Bytes	2023-1-1 17:54:44
AC	魑归sama	1ms	384 KiB		194 Bytes	2022-7-12 16:55:11
AC	杨淇瑞 (杨淇瑞29)	1ms	384 KiB		198 Bytes	2023-4-16 12:56:36
AC	ymh	1ms	384 KiB		194 Bytes	2022-4-17 10:19:48
AC	黄梓轩 (huangzixuan)	1ms	392 KiB		233 Bytes	2022-6-11 17:17:32
AC	huanglu	1ms	384 KiB		221 Bytes	2022-5-25 22:21:19