输出杨辉三角形

状态	递交者	时间	内存	代码	递交时间
AC	Tsunami (丁宇平)	29ms	6.9 MiB	356 Bytes	2023-11-5 14:21:38
AC	Aphrode	29ms	6.7 MiB	463 Bytes	2023-8-31 10:23:12
AC	李卓燃 (李卓燃1)	29ms	512 KiB	276 Bytes	2023-3-28 21:22:07
AC	执剑人罗辑 (Jasson)	29ms	512 KiB	509 Bytes	2023-2-1 21:24:32
AC	x0l0x	29ms	6.8 MiB	315 Bytes	2023-10-3 21:19:52
AC	曲奇饼干	29ms	384 KiB	357 Bytes	2023-4-16 10:54:04
AC	11451254188 (22029-mjh)	29ms	440 KiB	483 Bytes	2023-2-12 20:40:27
AC	huenjun	29ms	6.8 MiB	261 Bytes	2023-10-9 19:59:32
AC	林凡童 (lft)	29ms	512 KiB	447 Bytes	2022-9-15 19:57:20
AC	陈杰晟	29ms	440 KiB	423 Bytes	2023-2-15 14:08:17
AC	冒牌陈杰晟【MOD】 (wed)	29ms	448 KiB	323 Bytes	2022-3-2 21:06:07
AC	XYZ303	29ms	436 KiB	435 Bytes	2022-2-27 11:30:54
AC	时代一校 - 冯隆浩 (冯隆浩)	29ms	436 KiB	371 Bytes	2022-7-3 19:35:56
AC	在煎鱼的肖大总铳 (肖宇航)	29ms	6.8 MiB	396 Bytes	2023-9-24 11:22:08
AC	Tsunami (丁宇平)	29ms	6.9 MiB	320 Bytes	2023-11-5 14:24:07
AC	汪致卉 (wangzh)	29ms	484 KiB	447 Bytes	2022-4-22 18:42:56
AC	朱老师 (zyp)	29ms	440 KiB	379 Bytes	2022-8-5 10:14:53
AC	陈泰羽 (chentaiyu)	29ms	384 KiB	293 Bytes	2023-3-30 21:59:47
AC	谭懿轩 (yanyixuan)	29ms	440 KiB	275 Bytes	2022-8-9 15:39:53
AC	dustsans (njo)	29ms	512 KiB	343 Bytes	2023-5-12 17:25:08
AC	zlx (xiao)	29ms	512 KiB	651 Bytes	2022-11-26 18:24:10
AC	偽艺術家 (chenyanchi22006)	29ms	512 KiB	315 Bytes	2022-8-12 18:48:27
AC	xiongxinyao	29ms	428 KiB	370 Bytes	2023-5-11 19:08:43
AC	周琪渃	29ms	392 KiB	563 Bytes	2023-2-1 18:39:00
AC	何星震 (Jacob)	29ms	392 KiB	1.2 KiB	2022-10-3 12:34:47
AC	赵鑫宸 (xiaoxiao721)	29ms	512 KiB	368 Bytes	2022-3-4 20:36:24
AC	zcx	29ms	432 KiB	450 Bytes	2023-1-29 10:12:18
AC	ycy	29ms	512 KiB	333 Bytes	2022-11-22 21:42:36
AC	伍行念 (wuxingnian)	29ms	6.8 MiB	607 Bytes	2023-10-27 15:10:47
AC	陈杰晟	29ms	512 KiB	354 Bytes	2022-3-12 15:40:21
AC	刘致言	30ms	512 KiB	403 Bytes	2022-9-22 20:34:44
AC	1396013295	30ms	440 KiB	630 Bytes	2022-1-22 19:25:10
AC	江坤锜	30ms	6.4 MiB	480 Bytes	2023-6-3 17:55:03
AC	我推的乱破 (贺俊楠)	30ms	512 KiB	333 Bytes	2023-5-14 14:57:20
AC	爱琴海校区-刁钲洋 (刁钲洋)	30ms	512 KiB	483 Bytes	2023-1-29 22:31:20
AC	新壹街-曾浩坤 (曾浩坤)	30ms	6.8 MiB	365 Bytes	2023-6-27 18:21:38
AC	SB (mfy01)	30ms	512 KiB	381 Bytes	2023-2-3 17:32:24
AC	xiongxinyao	30ms	496 KiB	390 Bytes	2023-5-26 19:43:57
AC	scallway	30ms	392 KiB	391 Bytes	2022-12-10 16:52:25
AC	yang	30ms	488 KiB	350 Bytes	2022-9-8 12:47:40
AC	ycy	30ms	392 KiB	453 Bytes	2022-11-22 16:14:40
AC	RanHao	30ms	6.9 MiB	345 Bytes	2023-7-25 14:45:39
AC	陈雨泽1	30ms	512 KiB	385 Bytes	2023-2-18 11:30:18
AC	中岛敦 (黄麒瑞)	30ms	6.8 MiB	383 Bytes	2023-10-15 9:05:02
AC	huanglu	30ms	6.2 MiB	437 Bytes	2023-11-9 14:51:32
AC	欧俊阳	30ms	6.9 MiB	411 Bytes	2023-7-28 11:13:40
AC	何星震 (Jacob)	30ms	512 KiB	1.2 KiB	2023-3-3 20:49:03
AC	欧俊阳	30ms	6.9 MiB	411 Bytes	2023-7-28 11:10:39
AC	王晴萱	30ms	7.5 MiB	295 Bytes	2023-7-18 13:54:57
AC	薛君临	30ms	6.9 MiB	354 Bytes	2023-8-20 18:01:03
AC	爱琴海校区-黄辰浩 (huangchenhao)	30ms	512 KiB	351 Bytes	2023-3-5 15:34:54
AC	刘政君 (lzj)	31ms	512 KiB	376 Bytes	2022-8-16 19:26:55
AC	欧俊阳	31ms	6.9 MiB	486 Bytes	2023-7-28 11:08:00
AC	zyl	31ms	7.3 MiB	440 Bytes	2024-1-5 15:52:02
AC	22029-hqh	31ms	384 KiB	356 Bytes	2023-1-9 11:50:45
AC	时代2校-程俊燃 (chengjunran)	31ms	6.9 MiB	378 Bytes	2023-6-17 20:26:14
AC	黄梓轩 (huangzixuan)	31ms	512 KiB	425 Bytes	2023-2-11 13:54:08
AC	杨坤霖 (steven)	31ms	384 KiB	483 Bytes	2023-1-15 15:26:48
AC	xiangsiyu	31ms	436 KiB	447 Bytes	2022-7-5 16:58:55
AC	jighghjkfkhfdhdfdfdsfsdfsafvmnkbnkbmnlvnmkbvnvb;,.m;,;.;,;kbvlmkbnlmkblnvkmlbnkmlbvkmlbvklmbkmlkblmbnm;,l.,.;,'.,';.[',;.[,kjkoihgfhfgiohifgohifgohiofgihgofhiofgihofgihofgihofgiho;''[;.',m;.',m.;',.;'m,.;';'cv;x'cb'cx;b'cv;b'xc;b'c;b'cvbvc.'bv.//,/vb./vcb./cvbv,c.b,cv.,b.cv,b.vc,bg;hgl;hgl;hg;h;hfg;hl;lf;l;lxc;cln;bvln;vcln;vnl;vbl;vbln;vlv;blnvb;plnp;lplhfljpjh;nlvb;nv;bn;vcvl;nlv;nlv;g;hjhchl;ghfghl;fghl;ltlh;l;hlf;lg;bnlc;;nlv;nbv;nbv;nvb;nlvcnl;xc;blxcb;ll;hg;lhgl;dfl;t;ldy;l;lyl;rewlt493;l;dl;dsflg;lsdlpbpcxobpocvbpopopopreopotpreotertertretert (litingxu)	31ms	6.8 MiB	308 Bytes	2023-10-22 16:20:53
AC	22029-hqh	31ms	384 KiB	356 Bytes	2023-1-9 11:50:46
AC	^_^ (ctc)	31ms	436 KiB	376 Bytes	2023-3-20 20:24:15
AC	22029-hqh	31ms	392 KiB	356 Bytes	2023-1-9 11:50:45
AC	zhm123	31ms	512 KiB	353 Bytes	2022-12-29 15:30:56
AC	陈骏逸 (chenjunyi)	31ms	392 KiB	408 Bytes	2022-10-2 11:40:21
AC	杨坤霖 (steven)	31ms	392 KiB	483 Bytes	2023-1-15 15:26:49
AC	李彭宋代诗人 (ljy123456)	31ms	436 KiB	485 Bytes	2023-3-21 14:47:15
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	31ms	384 KiB	461 Bytes	2023-1-9 11:25: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)	31ms	420 KiB	480 Bytes	2023-1-9 11:24:08
AC	喻文博 (22016-ywb)	31ms	512 KiB	353 Bytes	2022-12-18 11:32:07
AC	时代1校-杨宇轩 (杨宇轩)	32ms	6.7 MiB	343 Bytes	2023-8-22 12:38:47
AC	yiqiuyu23002	32ms	6.9 MiB	316 Bytes	2023-7-27 11:00:41
AC	胡澜之 (666hlz666)	32ms	6.7 MiB	359 Bytes	2023-8-28 11:19:38
AC	胡程禹	32ms	6.7 MiB	492 Bytes	2023-8-21 20:29:10
AC	22029-hqh	32ms	392 KiB	356 Bytes	2023-1-9 11:50:47
AC	无尽的想象 (谭仕高)	32ms	384 KiB	305 Bytes	2022-12-14 13:19:57
AC	22029-hqh	32ms	384 KiB	356 Bytes	2023-1-9 11:50:45
AC	22029-zjs	32ms	384 KiB	425 Bytes	2023-1-9 11:24:52
AC	杨坤霖 (steven)	32ms	384 KiB	483 Bytes	2023-1-15 15:26:49
AC	ganlin1	32ms	6.9 MiB	568 Bytes	2023-8-4 11:39:10
AC	22029-lsl	32ms	384 KiB	383 Bytes	2023-1-9 11:29:22
AC	22029-hqh	32ms	388 KiB	356 Bytes	2023-1-9 11:50:39
AC	22029-hqh	32ms	384 KiB	356 Bytes	2023-1-9 11:50:45
AC	陈家齐 (陈家齐1)	32ms	6.8 MiB	373 Bytes	2023-6-15 19:02:22
AC	时代二校-陈天成 (鸭缩毛巾)	32ms	6.9 MiB	377 Bytes	2023-6-17 21:51:12
AC	CK (李弘毅)	33ms	440 KiB	374 Bytes	2022-12-17 11:11:53
AC	22029-lyh	33ms	428 KiB	480 Bytes	2023-1-9 11:27:14
AC	游智棋	33ms	512 KiB	331 Bytes	2022-11-23 8:44:58
AC	新壹街校区-杨轩懿 (杨轩懿1)	33ms	6.9 MiB	305 Bytes	2023-7-25 13:08:12
AC	22029-hqh	33ms	384 KiB	356 Bytes	2023-1-9 11:50:46
AC	22029-hqh	33ms	392 KiB	356 Bytes	2023-1-9 11:50:45
AC	chen (peter)	33ms	6.8 MiB	522 Bytes	2023-6-17 9:24:25
AC	ycy	33ms	452 KiB	392 Bytes	2022-9-25 13:28:56
AC	10255	33ms	6.9 MiB	393 Bytes	2023-8-20 17:55:52
AC	时代一校-赵彦博 (zyb)	34ms	7.3 MiB	241 Bytes	2023-8-26 14:53:24
AC	蒲梓勋 (puzixun)	34ms	384 KiB	545 Bytes	2022-10-2 11:26:31
AC	scallway	34ms	512 KiB	336 Bytes	2022-12-10 13:18:56
AC	小忙果 (王昱杰)	34ms	7 MiB	306 Bytes	2023-7-18 9:01:45
AC	guozuming	34ms	448 KiB	281 Bytes	2022-12-10 18:33:26
AC	22029-hqh	34ms	384 KiB	356 Bytes	2023-1-9 11:50:46