Hello World

状态	递交者	时间	内存	语言	代码	递交时间
AC	周琪渃	1ms	8.2 MiB		94 Bytes	2022-12-12 15:22:47
AC	Stephen Stevenson	1ms	8.2 MiB		78 Bytes	2022-12-11 11:00:06
AC	(张洛诚)	1ms	7.5 MiB		103 Bytes	2023-5-27 19:39:48
AC	ylc	1ms	6.7 MiB		103 Bytes	2022-4-4 14:44:43
AC	谢延灏 (xeiyanhao---a handsome boy)	1ms	7.7 MiB		918 Bytes	2022-9-3 14:49:04
AC	郭人瑀 (guorenyu)	1ms	8 MiB		87 Bytes	2022-6-11 11:16:00
AC	郑qr	1ms	7.1 MiB	C++11	86 Bytes	2024-6-2 13:55:42
AC	别啊！	1ms	7 MiB		114 Bytes	2022-2-19 17:35:33
AC	鄢爱宸	1ms	6.9 MiB		176 Bytes	2023-11-4 10:59:42
AC	妮露	1ms	6.8 MiB		97 Bytes	2023-10-28 19:14:23
AC	ycy	1ms	8 MiB		110 Bytes	2023-1-31 19:32:01
AC	李荣轩	1ms	8 MiB		94 Bytes	2023-2-28 18:21:42
AC	lzy	1ms	7.8 MiB		92 Bytes	2023-4-1 11:24:09
AC	李荣轩	1ms	8 MiB		94 Bytes	2023-2-28 18:21:42
AC	顶尖轩崽	1ms	7.7 MiB		137 Bytes	2022-9-3 14:08:40
AC	代尚函笛卡尔 (daishanghan)	1ms	8 MiB		87 Bytes	2023-5-11 18:57:19
AC	张家赫	1ms	7.8 MiB		92 Bytes	2023-2-28 18:18:51
AC	zjl	1ms	8.1 MiB		92 Bytes	2023-5-14 13:41:22
AC	吾头飞至珠峰，甚痛！ (Starry)	1ms	8 MiB		83 Bytes	2022-9-24 17:22:19
AC	(张洛诚)	1ms	7.5 MiB		103 Bytes	2023-5-27 19:40:00
AC	赵耘毅	1ms	8.1 MiB		89 Bytes	2023-5-13 20:07:44
AC	郑尧 (zhengyao)	1ms	7 MiB		93 Bytes	2022-10-1 21:36:28
AC	邵冠铖2号	1ms	7.3 MiB		94 Bytes	2023-7-9 13:36:16
AC	炸鱼4000+ (dxc)	1ms	8 MiB		92 Bytes	2023-1-13 20:30:01
AC	李华峻 (willy)	1ms	6.7 MiB		92 Bytes	2022-11-7 17:27:49
AC	刘鹤枫 (liuhefeng)	1ms	8.1 MiB		97 Bytes	2022-7-20 20:15:43
AC	zhang (章愉霖是傻逼)	1ms	6.7 MiB		86 Bytes	2023-8-26 14:21:08
AC	A小涂	1ms	6.5 MiB		99 Bytes	2023-8-31 19:40:51
AC	(张洛诚)	1ms	7.5 MiB		103 Bytes	2023-5-27 19:39:23
AC	我很6 (zjj22031)	1ms	7 MiB		102 Bytes	2022-10-2 10:46:45
AC	代尚函笛卡尔 (daishanghan)	1ms	8 MiB		87 Bytes	2023-5-11 18:57:20
AC	(张洛诚)	1ms	7.5 MiB		103 Bytes	2023-5-27 19:39:47
AC	lichenrui23010	1ms	6.8 MiB		86 Bytes	2023-8-24 10:01:44
AC	He Yiqi (和平精英)	1ms	8.1 MiB		92 Bytes	2022-1-22 11:17:48
AC	李宜帆	1ms	8 MiB		93 Bytes	2023-2-28 18:18:03
AC	lch	1ms	7.3 MiB		78 Bytes	2022-7-6 20:07:48
AC	余sy	1ms	6.8 MiB	C++11	87 Bytes	2024-6-2 13:58:41
AC	煞笔笔	1ms	8.2 MiB		134 Bytes	2023-5-5 19:10:28
AC	yuandingyang22031	1ms	7.8 MiB		98 Bytes	2023-3-26 9:06:20
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	1ms	6.8 MiB	C++98	625 Bytes	2024-8-13 11:57:59
AC	星野光 (Hoshino Hikari)	1ms	6.8 MiB		108 Bytes	2023-10-19 20:23:47
AC	rqnk	1ms	7 MiB		89 Bytes	2023-8-21 10:45:11
AC	yuandingyang22031	1ms	7.8 MiB		98 Bytes	2023-3-26 9:06:17
AC	xiaoenen	1ms	7.2 MiB		95 Bytes	2023-3-18 9:49:25
AC	别啊！	1ms	7 MiB		114 Bytes	2022-2-19 17:35:31
AC	林小博	1ms	7 MiB		84 Bytes	2022-2-15 15:14:41
AC	zhuqiwei22006	1ms	7.5 MiB		93 Bytes	2022-3-20 18:34:15
AC	冉浩然	1ms	6.8 MiB		91 Bytes	2023-8-24 11:49:43
AC	殷梓琦	1ms	7.3 MiB		93 Bytes	2023-6-11 8:50:53
AC	张家赫	1ms	7.8 MiB		92 Bytes	2023-2-28 18:18:56
AC	李睿杰	1ms	7.7 MiB		91 Bytes	2022-9-1 21:30:30
AC	郑岐蔚	1ms	7.7 MiB		97 Bytes	2022-8-27 18:57:15
AC	zhouqiruo	1ms	7.7 MiB		102 Bytes	2022-8-27 18:56:42
AC	(张洛诚)	1ms	7.5 MiB		103 Bytes	2023-5-27 19:40:00
AC	曾龙兮	1ms	7.4 MiB		97 Bytes	2022-9-11 16:40:38
AC	钟京润	1ms	7.8 MiB		78 Bytes	2022-4-30 14:37:00
AC	孔思鳗	1ms	6.8 MiB		96 Bytes	2023-10-15 10:08:52
AC	王星皓	1ms	7.5 MiB		117 Bytes	2022-2-24 20:34:27
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	6.7 MiB		95 Bytes	2023-9-17 7:56:28
AC	qinmengying	1ms	7.9 MiB		82 Bytes	2022-3-11 20:02:18
AC	赵耘毅	1ms	8.1 MiB		89 Bytes	2023-5-13 20:07:45
AC	李卓航 (鲨beeYKL)	1ms	6.7 MiB		108 Bytes	2023-9-2 16:27:21
AC	坤坤荔枝小黑子 (zhonghaotian22006)	1ms	6.6 MiB		102 Bytes	2022-7-2 17:09:56
AC	代尚函笛卡尔 (daishanghan)	1ms	8 MiB		87 Bytes	2023-5-11 18:57:20
AC	杨皓淞	1ms	7.4 MiB		116 Bytes	2023-7-9 8:54:10
AC	新壹街校区-冉睦阳 (冉睦阳)	1ms	7.5 MiB		92 Bytes	2023-5-27 11:44:26
AC	新壹街校区-陈品烨 (陈品烨)	1ms	7.5 MiB		92 Bytes	2023-5-22 7:24:49
AC	Randy Marsh (杨子腾)	1ms	8.1 MiB		91 Bytes	2022-1-22 9:14:40
AC	(张洛诚)	1ms	7.5 MiB		103 Bytes	2023-5-27 19:39:47
AC	Chter	1ms	6.6 MiB		94 Bytes	2023-9-24 12:31:47
AC	何星震 (Jacob)	1ms	7.5 MiB		91 Bytes	2023-2-7 20:39:15
AC	梁金同 (liangjintong)	1ms	7 MiB		95 Bytes	2022-10-23 18:20:21
AC	黎湘渝	1ms	8 MiB		93 Bytes	2023-2-28 18:18:13
AC	黎湘渝	1ms	8 MiB		93 Bytes	2023-2-28 18:18:12
AC	黄梓桐 (HuangZiTong)	1ms	7.4 MiB		97 Bytes	2023-3-19 15:31:48
AC	zhangjiani	1ms	7.3 MiB		104 Bytes	2022-7-9 17:29:28
AC	谭红中 (不知道)	1ms	7.5 MiB		94 Bytes	2022-4-22 19:12:02
AC	jop	1ms	8.2 MiB		98 Bytes	2022-1-18 11:08:16
AC	5675858 (tianhaochu)	1ms	7.9 MiB		94 Bytes	2022-4-16 21:06:16
AC	李宜帆	1ms	8 MiB		93 Bytes	2023-2-28 18:18:05
AC	诸禹吉 (zhuyuji)	1ms	8 MiB		83 Bytes	2022-1-23 16:18:46
AC	蒋青峰	1ms	7.2 MiB		90 Bytes	2023-7-11 9:52:46
AC	xxteacher	1ms	7.6 MiB		80 Bytes	2022-1-25 9:54:37
AC	你爹 (郭铠嘉)	1ms	7.5 MiB		101 Bytes	2022-5-10 21:28:16
AC	youhonglin	1ms	8.2 MiB		87 Bytes	2023-5-5 19:14:59
AC	甘梓琪	1ms	8.1 MiB		103 Bytes	2022-1-21 17:14:13
AC	刘思邑	1ms	8 MiB		92 Bytes	2023-2-28 18:21:16
AC	明哲瀚 (18580067605)	1ms	6.8 MiB		98 Bytes	2022-11-2 19:56:56
AC	youhonglin	1ms	8.2 MiB		87 Bytes	2023-5-5 19:15:00
AC	yuandingyang22031	1ms	7.8 MiB		98 Bytes	2023-3-26 9:06:27
AC	yijiujun	1ms	8 MiB		90 Bytes	2023-2-18 17:20:30
AC	陈秋石	1ms	7.5 MiB		112 Bytes	2022-2-13 11:26:56
AC	卢永辉	1ms	6.5 MiB		103 Bytes	2023-9-10 14:52:24
AC	李华峻 (willy)	1ms	8.2 MiB		92 Bytes	2022-11-7 17:28:06
AC	金沙校区-倪晨睿 (倪晨睿)	1ms	6.5 MiB		92 Bytes	2023-9-2 10:29:46
AC	纪承熙	1ms	8 MiB		127 Bytes	2022-2-19 19:02:10
AC	youhonglin	1ms	8.2 MiB		87 Bytes	2023-5-5 19:14:49
AC	588	1ms	6.9 MiB	C++98(O2)	103 Bytes	2024-5-25 21:25:50
AC	言年想摆烂~	1ms	8 MiB		99 Bytes	2023-2-27 22:22:47
AC	(张洛诚)	1ms	8.1 MiB		103 Bytes	2022-8-2 19:06:20