字符三角形

状态	递交者	时间	内存	语言	代码	递交时间
AC	王玺懿 (wxy)	53ms	444 KiB		192 Bytes	2022-9-11 13:02:18
AC	杨宇航1	53ms	496 KiB		181 Bytes	2023-2-19 15:26:46
AC	周琪渃	53ms	416 KiB		184 Bytes	2022-12-31 17:21:02
AC	印昭旭（412） (印昭旭)	53ms	556 KiB		172 Bytes	2023-4-2 10:58:30
AC	黄梓桐 (HuangZiTong)	53ms	440 KiB		183 Bytes	2022-6-25 21:01:46
AC	时代一校林星宇 (lxy)	53ms	480 KiB		177 Bytes	2022-9-3 20:46:03
AC	Jack	53ms	520 KiB		171 Bytes	2023-3-28 21:36:56
AC	杜俊宏	54ms	476 KiB		178 Bytes	2022-6-12 8:30:18
AC	xiangsiyu	54ms	420 KiB		218 Bytes	2022-6-23 21:04:14
AC	中岛敦 (黄麒瑞)	54ms	7.1 MiB		200 Bytes	2023-12-10 9:05:20
AC	Tang	54ms	508 KiB		196 Bytes	2022-4-9 9:17:14
AC	luojunyang	54ms	484 KiB		207 Bytes	2022-1-21 10:27:16
AC	蒲梓勋 (puzixun)	54ms	440 KiB		183 Bytes	2022-9-11 12:05:22
AC	yuhaodi	54ms	580 KiB		248 Bytes	2023-5-23 16:56:31
AC	(张洛诚)	54ms	440 KiB		246 Bytes	2023-4-29 7:46:53
AC	xuniaoyin (徐袅音)	54ms	464 KiB		170 Bytes	2023-2-19 15:29:42
AC	罗晨睿 (luochenrui)	54ms	496 KiB		190 Bytes	2022-6-29 13:31:34
AC	呵 (mohaoran)	54ms	448 KiB		176 Bytes	2022-7-5 18:43:06
AC	张峻熙	54ms	424 KiB		177 Bytes	2022-9-3 20:43:22
AC	新壹街校区-陈琬舒 (空空大师)	54ms	6.7 MiB		186 Bytes	2023-9-13 11:24:07
AC	wky	54ms	428 KiB		213 Bytes	2022-6-26 18:14:59
AC	冒牌陈杰晟【MOD】 (wed)	54ms	488 KiB		160 Bytes	2022-2-28 22:30:32
AC	kim	54ms	524 KiB		207 Bytes	2023-3-10 20:26:14
AC	时代校区-刘臣原 (微笑王子)	54ms	548 KiB		169 Bytes	2022-9-3 20:39:24
AC	王晨志 (wangchenzhi)	54ms	444 KiB		229 Bytes	2022-6-18 4:59:14
AC	范宜灵	54ms	488 KiB		206 Bytes	2022-6-21 15:57:38
AC	scallway	54ms	460 KiB		189 Bytes	2022-11-20 10:49:50
AC	Yangshenxin (𝒲𝒶𝓉𝑒𝓇)	55ms	420 KiB		194 Bytes	2022-1-23 20:05:42
AC	zhm123	55ms	484 KiB		191 Bytes	2022-9-11 10:43:28
AC	zyq1	55ms	508 KiB		190 Bytes	2023-4-10 20:13:29
AC	SYC0226	55ms	488 KiB		202 Bytes	2022-3-20 13:38:49
AC	贾鑫豪 (Mr Sam)	55ms	456 KiB		188 Bytes	2022-2-26 14:54:19
AC	陈诺	55ms	7 MiB		193 Bytes	2023-12-27 17:14:28
AC	龙吉先 (ljx)	55ms	6.9 MiB	C++98	212 Bytes	2024-8-22 14:54:38
AC	李龙腾 (llt)	55ms	472 KiB		199 Bytes	2022-9-3 20:31:22
AC	火爆肥肠（杨弘毅） (火爆肥肠)	55ms	528 KiB		207 Bytes	2022-3-30 21:22:45
AC	李卓燃 (李卓燃1)	55ms	472 KiB		205 Bytes	2023-3-10 20:40:29
AC	NJL (NJlL)	55ms	484 KiB		205 Bytes	2022-7-6 15:12:45
AC	肖添宇	55ms	456 KiB		213 Bytes	2022-5-14 17:50:51
AC	zhangyh (张育菡)	55ms	464 KiB		186 Bytes	2022-6-10 22:39:37
AC	时代一校-赵彦博 (zyb)	55ms	6.9 MiB		182 Bytes	2023-7-15 11:09:58
AC	姚宏逸	55ms	424 KiB		277 Bytes	2022-3-28 9:54:39
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	55ms	420 KiB		221 Bytes	2023-1-7 11:09:14
AC	GYZ	55ms	512 KiB		212 Bytes	2022-5-22 20:54:19
AC	时代一校 - 冯隆浩 (冯隆浩)	55ms	512 KiB		181 Bytes	2022-7-2 19:38:00
AC	新一街校区Jason_LuoYouZheng (罗友峥)	55ms	512 KiB		165 Bytes	2022-2-26 10:48:24
AC	秦子越 (13883322087)	56ms	460 KiB		187 Bytes	2022-2-18 18:51:52
AC	罗宇凡 (吴彦祖)	56ms	488 KiB		229 Bytes	2022-1-21 10:29:56
AC	22029-hqh	56ms	444 KiB		183 Bytes	2023-1-7 11:55:10
AC	zhengjiaxiang	56ms	428 KiB		193 Bytes	2023-3-10 20:41:30
AC	郑岐蔚	56ms	520 KiB		178 Bytes	2023-1-26 14:35:42
AC	Ronnie	56ms	512 KiB		179 Bytes	2022-1-21 10:26:23
AC	王韵淮	56ms	420 KiB		167 Bytes	2022-5-19 12:53:24
AC	miku (阳沐珊)	56ms	516 KiB		189 Bytes	2022-6-18 11:36:07
AC	王晴萱	56ms	7.4 MiB		195 Bytes	2023-7-14 14:33:50
AC	ycy	56ms	460 KiB		230 Bytes	2022-7-6 12:44:19
AC	炼狱杏寿郎（的粉粉粉粉粉） (sheijiangwohh)	56ms	512 KiB		293 Bytes	2022-2-26 14:46:39
AC	chaikexu	56ms	520 KiB		178 Bytes	2022-9-11 11:40:30
AC	cheers 戴 (daizhuorun)	56ms	452 KiB		183 Bytes	2022-2-9 14:03:53
AC	17779	56ms	424 KiB		207 Bytes	2022-3-21 15:17:53
AC	科比.布莱恩特 (董浩琰)	56ms	7.5 MiB		189 Bytes	2023-7-20 19:10:09
AC	王重道	56ms	436 KiB		183 Bytes	2022-4-16 18:18:23
AC	ttt123	57ms	448 KiB		225 Bytes	2022-12-4 20:14:55
AC	我推的乱破 (贺俊楠)	57ms	440 KiB		172 Bytes	2023-4-30 14:18:20
AC	杨瀚霖 (yanghanlin)	57ms	436 KiB		215 Bytes	2023-3-11 10:00:12
AC	. (Pig)	57ms	424 KiB		183 Bytes	2022-1-21 10:12:19
AC	谭懿轩 (yanyixuan)	57ms	428 KiB		172 Bytes	2022-2-19 9:56:14
AC	张梓浩 (zhangzihao)	57ms	452 KiB		213 Bytes	2023-5-24 19:22:29
AC	铁牛杰哥官方频道	57ms	440 KiB		196 Bytes	2022-3-9 20:17:01
AC	yaokaixin	57ms	484 KiB		209 Bytes	2022-1-21 10:31:51
AC	何星震 (Jacob)	57ms	440 KiB		169 Bytes	2022-9-15 19:59:18
AC	MoonLight ( aaa)	57ms	1.3 MiB		324 Bytes	2022-1-22 9:48:46
AC	jop	57ms	432 KiB		245 Bytes	2022-1-21 10:17:11
AC	piter	57ms	512 KiB		205 Bytes	2022-2-26 14:45:53
AC	XYZ303	57ms	424 KiB		197 Bytes	2022-1-21 10:15:06
AC	12345	57ms	492 KiB		233 Bytes	2022-2-26 14:56:20
AC	zcx	57ms	516 KiB		182 Bytes	2023-1-7 11:03:06
AC	kim	57ms	428 KiB		207 Bytes	2023-3-10 20:26:11
AC	叶雨昊 (yeyuhao22006)	57ms	512 KiB		167 Bytes	2022-10-23 20:12:56
AC	huyinuo	58ms	452 KiB		184 Bytes	2022-2-26 19:34:35
AC	huanghaoming	58ms	480 KiB		176 Bytes	2022-9-11 19:23:06
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)	58ms	508 KiB		187 Bytes	2023-1-7 11:07:09
AC	经常消失 (小萝卜)	58ms	540 KiB		189 Bytes	2022-2-26 14:53:13
AC	胡程禹	58ms	440 KiB		221 Bytes	2023-5-6 20:59:03
AC	ywh	58ms	440 KiB		210 Bytes	2022-2-26 10:45:56
AC	李龙腾 (llt)	58ms	440 KiB		184 Bytes	2023-3-19 14:40:46
AC	神秘人 (张涵曦大帅哥)	58ms	512 KiB		185 Bytes	2022-2-26 14:46:10
AC	22029-lyh	58ms	476 KiB		166 Bytes	2023-1-7 11:02:32
AC	🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕 (bro)	58ms	480 KiB		219 Bytes	2022-1-25 16:07:55
AC	wangzhijie	58ms	548 KiB		217 Bytes	2022-2-26 14:54:34
AC	你猜呀	58ms	484 KiB		176 Bytes	2023-5-25 20:20:04
AC	时代一校-王宥量 (wangyouliang)	58ms	432 KiB		177 Bytes	2022-11-24 13:46:13
AC	我很6 (zjj22031)	58ms	452 KiB		237 Bytes	2023-1-9 11:24:37
AC	CK (李弘毅)	58ms	476 KiB		177 Bytes	2022-11-22 11:25:21
AC	张梓辰 (DiaoDesi屌德斯)	58ms	512 KiB		212 Bytes	2022-7-18 19:42:26
AC	蒋丁非凡	58ms	464 KiB		209 Bytes	2023-6-2 18:33:00
AC	yaokaixuan	59ms	544 KiB		217 Bytes	2022-1-21 10:13:00
AC	ymh	59ms	452 KiB		180 Bytes	2022-2-26 14:54:24
AC	李树崑 (lishukun)	59ms	432 KiB		222 Bytes	2022-2-26 14:54:56
AC	^_^ (ctc)	59ms	436 KiB		178 Bytes	2022-10-19 20:38:15