Hello World

状态	递交者	时间	内存	语言	代码	递交时间
AC	wangzihang	1ms	8 MiB		106 Bytes	2022-2-26 14:43:48
AC	黄梓桐 (HuangZiTong)	1ms	8.1 MiB		86 Bytes	2023-2-3 14:37:54
AC	黄梓桐 (HuangZiTong)	1ms	8 MiB		86 Bytes	2023-2-3 14:37:48
AC	李霄麒	1ms	8 MiB		80 Bytes	2023-2-28 18:26:32
AC	向俊熙 (xiangjunxi23003)	1ms	7.5 MiB		85 Bytes	2023-2-4 17:54:43
AC	黎湘渝	1ms	8 MiB		93 Bytes	2023-2-28 18:18:00
AC	Jose (反恐皮蛋)	1ms	8.1 MiB		136 Bytes	2022-1-23 15:01:00
AC	罗康恒23025	1ms	6.5 MiB		157 Bytes	2023-9-3 13:53:08
AC	张峻熙	1ms	8 MiB		102 Bytes	2022-4-16 16:43:49
AC	🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕 (bro)	1ms	8.1 MiB		114 Bytes	2022-1-23 13:02:01
AC	冯隆浩（小号）	1ms	8.2 MiB		97 Bytes	2022-7-20 13:40:02
AC	全体目光向我看齐!我是SB (XSB)	1ms	8 MiB		79 Bytes	2023-4-14 21:24:17
AC	刘骏峰1	1ms	7.2 MiB	C++98	99 Bytes	2024-5-12 11:03:24
AC	强愉堃	1ms	7.5 MiB		99 Bytes	2023-2-5 10:46:23
AC	yuandingyang22031	1ms	7.8 MiB		98 Bytes	2023-3-26 9:06:24
AC	ymh	1ms	7.1 MiB		86 Bytes	2022-3-26 16:24:13
AC	张峻尘 (zjc)	1ms	8 MiB		101 Bytes	2022-6-12 10:42:51
AC	向俊熙 (xiangjunxi23003)	1ms	7.5 MiB		85 Bytes	2023-2-4 17:55:17
AC	炸鱼4000+ (dxc)	1ms	8 MiB		92 Bytes	2023-1-13 20:29:47
AC	炸鱼4000+ (dxc)	1ms	8.1 MiB		92 Bytes	2023-1-13 20:29:29
AC	wangzihan	1ms	7.7 MiB		90 Bytes	2022-10-30 14:05:06
AC	陈于硕(我™的) (chenyu)	1ms	8 MiB		78 Bytes	2023-3-4 11:05:59
AC	李华峻 (willy)	1ms	8.2 MiB		97 Bytes	2022-11-7 17:25:43
AC	赵彬鸿	1ms	7.6 MiB		100 Bytes	2022-1-25 10:53:01
AC	颜新雨3	1ms	6.7 MiB		103 Bytes	2022-4-9 13:50:13
AC	ymh	1ms	7.1 MiB		86 Bytes	2022-3-26 16:28:44
AC	蒋一彰	1ms	8.1 MiB		95 Bytes	2022-4-9 19:34:07
AC	王祎辰 (wangyichen)	1ms	8.1 MiB		100 Bytes	2022-8-13 14:26:28
AC	繁星 (05c35-zzm)	1ms	8 MiB		100 Bytes	2022-5-22 14:08:03
AC	阚一鸣	1ms	7.1 MiB		112 Bytes	2022-10-23 14:36:04
AC	吴佳智 (AWM)	1ms	7.7 MiB		112 Bytes	2023-2-4 10:57:51
AC	罗当当	1ms	7.3 MiB		106 Bytes	2022-6-25 11:50:49
AC	某某 (xuhaotian)	1ms	7 MiB		84 Bytes	2022-2-19 14:41:57
AC	刘老师 (图书管理员)	1ms	6.6 MiB		97 Bytes	2022-6-30 14:56:36
AC	李华峻 (willy)	1ms	8.2 MiB		92 Bytes	2022-11-7 17:28:04
AC	wangzihan	1ms	7.7 MiB		90 Bytes	2022-10-30 14:05:07
AC	黄梓桐 (HuangZiTong)	1ms	7.4 MiB		97 Bytes	2023-3-19 15:31:48
AC	代尚函笛卡尔 (daishanghan)	1ms	8.2 MiB		92 Bytes	2022-11-13 14:22:33
AC	童艺涵	1ms	8.2 MiB		92 Bytes	2022-11-12 9:14:23
AC	王祎辰 (wangyichen)	1ms	7.5 MiB		96 Bytes	2022-9-10 18:55:44
AC	李荣轩	1ms	8 MiB		94 Bytes	2023-2-28 18:21:41
AC	甘梓琪	1ms	8.1 MiB		103 Bytes	2022-1-21 17:14:02
AC	yuandingyang22031	1ms	7.8 MiB		98 Bytes	2023-3-26 9:06:41
AC	郭人瑀	1ms	7.5 MiB		93 Bytes	2022-3-19 20:41:52
AC	偽艺術家 (chenyanchi22006)	1ms	7.5 MiB		101 Bytes	2022-3-20 18:33:30
AC	张峻尘 (zjc)	1ms	8 MiB		101 Bytes	2022-6-12 10:35:03
AC	炸鱼4000+ (dxc)	1ms	8 MiB		92 Bytes	2023-1-13 20:29:48
AC	郑妍汐	1ms	8.2 MiB		141 Bytes	2022-1-18 19:24:57
AC	谢思睿	1ms	6.7 MiB		91 Bytes	2023-8-30 15:43:58
AC	(张洛诚)	1ms	8 MiB		103 Bytes	2022-5-22 17:12:03
AC	旷山 (15213268688)	1ms	8.1 MiB		85 Bytes	2022-1-22 11:20:54
AC	奇怪的正义人！ (leweiqi)	1ms	7.7 MiB		102 Bytes	2022-6-18 7:25:05
AC	李卓燃	1ms	8 MiB		79 Bytes	2023-1-18 18:45:53
AC	魏楚浔 (shawn)	1ms	8 MiB		85 Bytes	2022-2-27 18:10:24
AC	杀尽天下人	1ms	8.1 MiB		62 Bytes	2022-7-25 19:49:04
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-8-29 10:40:46
AC	dddhhhxxx	1ms	7.3 MiB		93 Bytes	2022-7-10 16:43:11
AC	礼貌塞班	1ms	8 MiB		96 Bytes	2023-1-31 15:48:36
AC	自由钢普拉追尼胎梅 (徐攒焱)	1ms	6.5 MiB		97 Bytes	2023-8-26 16:41:15
AC	lihongyi	1ms	8.2 MiB		92 Bytes	2022-11-10 11:20:51
AC	黎湘渝	1ms	7.8 MiB		93 Bytes	2023-2-28 18:20:08
AC	李华峻 (willy)	1ms	8.2 MiB		92 Bytes	2022-11-7 17:26:25
AC	吴佳智 (AWM)	1ms	7.8 MiB		112 Bytes	2023-2-4 10:57:50
AC	在线销售纯洁晟！！！	1ms	6.6 MiB		102 Bytes	2022-6-30 13:37:55
AC	袁辰奕 (yuanchenyi11b)	1ms	8.2 MiB		100 Bytes	2022-7-18 19:25:02
AC	wangjunhan	1ms	8 MiB		92 Bytes	2022-1-23 16:07:11
AC	李宜帆	1ms	8 MiB		93 Bytes	2023-2-28 18:18:11
AC	张峻尘 (zjc)	1ms	8 MiB		101 Bytes	2022-6-12 10:42:42
AC	在线销售纯洁晟 (1+9)	1ms	8 MiB		76 Bytes	2022-3-3 18:14:53
AC	龙吉先 (ljx)	1ms	7.6 MiB		91 Bytes	2023-2-4 11:12:13
AC	(张洛诚)	1ms	7.5 MiB		103 Bytes	2023-5-27 19:39:23
AC	11002	1ms	8 MiB		99 Bytes	2022-2-19 19:08:43
AC	chen (peter)	1ms	8 MiB		115 Bytes	2022-3-1 21:53:04
AC	chen (peter)	1ms	8 MiB		120 Bytes	2022-2-20 18:36:34
AC	chen (peter)	1ms	8 MiB		120 Bytes	2022-2-20 18:36:32
AC	甘梓琪	1ms	8.1 MiB		103 Bytes	2022-1-21 17:14:13
AC	lvlu	1ms	8.1 MiB		88 Bytes	2022-7-21 18:20:03
AC	宫保鸡丁 (wxp)	1ms	6.7 MiB		96 Bytes	2022-4-4 14:42:41
AC	郑皓宸	1ms	6.9 MiB		90 Bytes	2023-10-21 18:34:06
AC	黄梓桐 (HuangZiTong)	1ms	8 MiB		86 Bytes	2023-2-3 14:37:48
AC	我是个s* (lijinze)	1ms	7.8 MiB		95 Bytes	2022-5-1 18:46:30
AC	明轩 (吕同学)	1ms	8.1 MiB		100 Bytes	2022-8-9 15:24:29
AC	(张洛诚)	1ms	8.1 MiB		103 Bytes	2022-8-2 19:06:01
AC	罗翌珂 (dangdang)	1ms	8 MiB		106 Bytes	2022-6-3 11:22:42
AC	苏庭毅	1ms	8.1 MiB		93 Bytes	2023-1-13 20:29:38
AC	我谢谢你全家	1ms	8 MiB		91 Bytes	2022-2-20 19:10:34
AC	Qinxiu	1ms	6.7 MiB	C++20(O2)	116 Bytes	2024-8-6 13:16:12
AC	黎湘渝	1ms	8 MiB		93 Bytes	2023-2-28 18:17:56
AC	Tender. (05c05-zhou)	1ms	8 MiB		95 Bytes	2022-6-10 20:00:43
AC	炸鱼4000+ (dxc)	1ms	8 MiB		92 Bytes	2023-1-13 20:29:50
AC	坤坤荔枝小黑子 (zhonghaotian22006)	1ms	6.6 MiB		102 Bytes	2022-7-2 17:10:04
AC	赵毕岑	1ms	8.1 MiB		84 Bytes	2022-1-22 8:27:33
AC	wangruibo20xh	1ms	8.2 MiB		87 Bytes	2022-1-8 21:40:00
AC	(张洛诚)	1ms	7.5 MiB		103 Bytes	2023-5-27 19:40:00
AC	王紫涵	1ms	8.2 MiB		92 Bytes	2023-5-7 18:06:09
AC	吴卓轩	1ms	8.1 MiB		99 Bytes	2022-7-22 10:57:10
AC	明哲瀚 (18580067605)	1ms	7.1 MiB		98 Bytes	2022-10-2 20:51:29
AC	郑qr	1ms	6.9 MiB	C++11	86 Bytes	2024-6-2 13:57:32
AC	guzhiyi	1ms	7.5 MiB		91 Bytes	2023-7-4 19:21:27
AC	余晨浩 (yuchenhao)	1ms	7.5 MiB		93 Bytes	2022-5-20 21:20:05