Hello World

状态	递交者	时间	内存	语言	代码	递交时间
AC	张家赫	1ms	8 MiB		92 Bytes	2023-2-28 18:20:24
AC	凡子桐	1ms	8 MiB		92 Bytes	2023-2-28 18:17:20
AC	坤坤荔枝小黑子 (zhonghaotian22006)	1ms	6.6 MiB		102 Bytes	2022-7-2 17:09:57
AC	向俊熙 (xiangjunxi23003)	1ms	7.5 MiB		85 Bytes	2023-2-4 17:55:14
AC	dmh (丁墨涵)	1ms	8.2 MiB		93 Bytes	2022-1-18 10:56:04
AC	(-v-)ikun ((-v-))	1ms	7.5 MiB		91 Bytes	2022-9-11 11:21:06
AC	李宜帆	1ms	8 MiB		93 Bytes	2023-2-28 18:14:57
AC	刘泽21	1ms	7.8 MiB		97 Bytes	2023-4-2 15:35:48
AC	德克萨斯做的到吗 (liyangbao)	1ms	7 MiB		100 Bytes	2022-10-24 16:50:22
AC	无尽的想象 (谭仕高)	1ms	7.6 MiB		93 Bytes	2023-7-4 19:17:25
AC	食不食油饼（点主页康康） (Nemo)	1ms	7.4 MiB		209 Bytes	2023-3-17 19:02:18
AC	林小博	1ms	7.8 MiB		74 Bytes	2023-3-25 11:37:22
AC	林子沫awa (linziyue)	1ms	7.9 MiB		85 Bytes	2022-3-11 19:59:24
AC	佐子佑	1ms	6.8 MiB		102 Bytes	2023-8-24 11:48:41
AC	(张洛诚)	1ms	7.5 MiB		103 Bytes	2023-5-27 19:39:22
AC	yu (赵子瑜)	1ms	8 MiB		99 Bytes	2022-2-21 20:03:29
AC	煞笔笔	1ms	8.2 MiB		134 Bytes	2023-5-5 19:10:29
AC	Randy Marsh (杨子腾)	1ms	8.1 MiB		91 Bytes	2022-1-22 9:14:37
AC	低调的学霸	1ms	8.1 MiB		84 Bytes	2022-8-17 15:12:32
AC	冯梓轩	1ms	8 MiB		100 Bytes	2022-2-25 20:17:17
AC	罗晨睿 (luochenrui)	1ms	7 MiB		91 Bytes	2022-6-19 16:17:11
AC	李宜帆	1ms	8 MiB		93 Bytes	2023-2-28 18:17:19
AC	BJ6180C8CTD (Fan)	1ms	6.6 MiB		99 Bytes	2023-9-16 14:41:57
AC	坤坤荔枝小黑子 (zhonghaotian22006)	1ms	6.6 MiB		102 Bytes	2022-7-2 17:10:07
AC	赵秋泽	1ms	7.4 MiB		119 Bytes	2023-7-9 8:54:11
AC	asfsdfsdf	1ms	8 MiB		105 Bytes	2023-1-1 17:42:33
AC	miku (阳沐珊)	1ms	7.8 MiB		78 Bytes	2022-5-3 15:12:08
AC	李华峻 (willy)	1ms	8.2 MiB		92 Bytes	2022-11-7 17:27:52
AC	dafu	1ms	7.1 MiB		98 Bytes	2023-4-4 22:24:08
AC	一个小黑	1ms	6.7 MiB		96 Bytes	2023-9-1 19:39:20
AC	laiyouming22031	1ms	8.1 MiB		127 Bytes	2022-12-25 13:23:39
AC	张家赫	1ms	7.8 MiB		92 Bytes	2023-2-28 18:19:05
AC	Hsa	1ms	7.1 MiB		90 Bytes	2022-9-18 10:57:51
AC	chenjincheng23005	1ms	6.7 MiB		96 Bytes	2023-8-26 14:32:18
AC	余晨浩 (yuchenhao)	1ms	7.9 MiB		88 Bytes	2022-8-24 15:34:41
AC	老六 (......)	1ms	7 MiB		130 Bytes	2022-10-31 22:04:53
AC	罗子琪	1ms	8 MiB		98 Bytes	2022-5-23 20:43:48
AC	葛琮扬	1ms	8 MiB		57 Bytes	2023-2-16 19:52:41
AC	熊瑾瑜	1ms	6.7 MiB		95 Bytes	2022-11-5 11:38:58
AC	yixingyou	1ms	6.6 MiB		86 Bytes	2022-7-2 14:58:39
AC	李某人	1ms	8.1 MiB		82 Bytes	2022-1-21 17:01:22
AC	huanglu	1ms	8 MiB		101 Bytes	2023-2-26 16:24:49
AC	05c35-hhw	1ms	7.9 MiB		97 Bytes	2022-3-13 8:56:28
AC	余晨浩 (yuchenhao)	1ms	7.9 MiB		88 Bytes	2022-8-24 15:34:41
AC	凡子桐	1ms	8 MiB		92 Bytes	2023-2-28 18:17:18
AC	时代二校-王盼兮 (wangpanxi)	1ms	8 MiB		78 Bytes	2023-1-9 11:03:57
AC	弹射起飞 ? 冲 ! (吴周周)	1ms	8 MiB		90 Bytes	2023-4-17 17:48:16
AC	啊...这 (炼狱杏寿郎)	1ms	8 MiB		88 Bytes	2022-4-16 13:20:25
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	7.4 MiB		95 Bytes	2023-6-3 19:27:41
AC	ljt	1ms	8 MiB		92 Bytes	2023-3-4 14:52:57
AC	李宜帆	1ms	8 MiB		93 Bytes	2023-2-28 18:18:11
AC	黎湘渝	1ms	7.8 MiB		93 Bytes	2023-2-28 18:20:06
AC	陈嘉熠	1ms	8.2 MiB		148 Bytes	2022-11-27 16:10:12
AC	郑之策	1ms	7.2 MiB		88 Bytes	2022-2-10 9:19:29
AC	坤坤荔枝小黑子 (zhonghaotian22006)	1ms	6.6 MiB		102 Bytes	2022-7-2 17:09:55
AC	qinlang	1ms	8.1 MiB		88 Bytes	2023-5-13 19:18:13
AC	黎湘渝	1ms	7.8 MiB		93 Bytes	2023-2-28 18:20:09
AC	wkr20090212	1ms	7.5 MiB		314 Bytes	2022-2-19 21:40:52
AC	纪承熙	1ms	8 MiB		127 Bytes	2022-2-19 19:02:10
AC	董博煜	1ms	7.5 MiB		103 Bytes	2023-2-8 11:14:08
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	1ms	8 MiB		137 Bytes	2023-3-5 21:04:16
AC	chen (peter)	1ms	8 MiB		120 Bytes	2022-2-20 18:36:35
AC	赵嘉泰	1ms	7.8 MiB		106 Bytes	2023-3-21 21:28:38
AC	Guest	1ms	6.9 MiB	C++98(O2)	70 Bytes	2024-5-26 15:54:37
AC	05c41-hzs	1ms	8 MiB		102 Bytes	2022-3-6 10:50:10
AC	罗竣瀚	1ms	7.5 MiB		89 Bytes	2022-6-19 15:13:18
AC	Randy Marsh (杨子腾)	1ms	8.1 MiB		91 Bytes	2022-1-22 9:14:42
AC	yzh01	1ms	7.3 MiB		93 Bytes	2022-7-2 19:24:08
AC	sam20110826	1ms	7.8 MiB		93 Bytes	2022-4-16 21:08:40
AC	李奕霖 (liyilin233)	1ms	8.1 MiB		84 Bytes	2022-4-9 18:50:12
AC	程舒然	1ms	6.6 MiB	C++11	86 Bytes	2024-7-11 14:51:16
AC	吴恩子	1ms	6.5 MiB		91 Bytes	2023-9-8 18:03:44
AC	22029-lsl	1ms	7 MiB		107 Bytes	2022-9-20 19:08:17
AC	李宜帆	1ms	8 MiB		93 Bytes	2023-2-28 18:18:11
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:27:53
AC	zyq1	1ms	7.8 MiB		92 Bytes	2023-3-27 20:53:53
AC	李华峻 (willy)	1ms	8.2 MiB		92 Bytes	2022-11-7 17:26:29
AC	新壹街-王俊博 (王俊博)	1ms	7.5 MiB		86 Bytes	2023-7-7 19:36:22
AC	cjy_133	1ms	7.6 MiB		100 Bytes	2022-9-3 18:38:07
AC	张峻尘 (zjc)	1ms	8 MiB		101 Bytes	2022-6-12 10:35:05
AC	魑归sama	1ms	7.3 MiB		83 Bytes	2022-7-12 19:25:13
AC	yuandingyang22031	1ms	7.8 MiB		98 Bytes	2023-3-26 9:06:32
AC	黎湘渝	1ms	7.8 MiB		93 Bytes	2023-2-28 18:20:03
AC	zhangheyi22006	1ms	8 MiB		103 Bytes	2022-12-25 18:49:59
AC	10255	1ms	8.2 MiB		92 Bytes	2022-11-27 14:15:27
AC	wuzhenghan	1ms	7.7 MiB		86 Bytes	2022-5-12 20:18:04
AC	pengjinhua23005	1ms	6.5 MiB		94 Bytes	2023-8-26 14:28:39
AC	葛琮扬	1ms	8 MiB		57 Bytes	2023-2-16 19:52:06
AC	刘思邑	1ms	8 MiB		92 Bytes	2023-2-28 18:21:17
AC	集合游戏账户	1ms	7 MiB		94 Bytes	2022-10-1 20:45:48
AC	赵耘毅	1ms	8.1 MiB		89 Bytes	2023-5-13 20:07:40
AC	时代2校+施皓宬 (shihaocheng)	1ms	8 MiB		95 Bytes	2023-2-18 15:23:20
AC	余晨浩 (yuchenhao)	1ms	8 MiB		88 Bytes	2022-8-24 15:34:37
AC	CK (李弘毅)	1ms	8.2 MiB		104 Bytes	2023-4-23 20:31:32
AC	周琪渃	1ms	8.2 MiB		94 Bytes	2022-12-12 15:22:47
AC	王家勋 (wangjiaxun)	1ms	7.3 MiB		113 Bytes	2022-7-10 11:02:46
AC	田世瑞	1ms	7.1 MiB		98 Bytes	2022-10-23 14:45:09
AC	谢博文	1ms	7.5 MiB		93 Bytes	2022-4-13 18:48:59
AC	李哲 (lizhe)	1ms	8 MiB		76 Bytes	2022-3-2 21:22:03