Hello World

状态	递交者	时间	内存	语言	代码	递交时间
AC	Nico	1ms	7.1 MiB		92 Bytes	2023-7-13 16:08:10
AC	严斯扬1	1ms	6.8 MiB	C++11	91 Bytes	2024-5-29 21:34:01
AC	chen (peter)	1ms	8 MiB		120 Bytes	2022-2-20 18:36:29
AC	张睎宇	1ms	6.9 MiB	C++17	94 Bytes	2024-5-18 13:18:39
AC	周米骐 (zsb)	1ms	6.7 MiB		101 Bytes	2023-10-7 18:24:41
AC	sb (杨锦睿)	1ms	7.1 MiB	C++11	98 Bytes	2024-5-12 15:43:08
AC	铁牛杰哥官方频道	1ms	8 MiB		95 Bytes	2022-3-9 19:59:25
AC	黄梓桐 (HuangZiTong)	1ms	8.1 MiB		86 Bytes	2023-2-3 14:38:06
AC	时代二校+马嘉宸 (majiachen)	1ms	7.5 MiB		94 Bytes	2023-2-11 17:44:37
AC	zhangzixuanaa	1ms	8 MiB		87 Bytes	2023-4-16 11:41:48
AC	y s e	1ms	6.8 MiB		92 Bytes	2023-10-5 14:23:41
AC	liujingxing(我要李毛川!) (liujingxing)	1ms	6.7 MiB		99 Bytes	2023-9-17 15:48:19
AC	weiqi	1ms	7 MiB		78 Bytes	2023-8-22 8:53:47
AC	qinlang	1ms	8 MiB		88 Bytes	2023-5-13 19:18:10
AC	444444444 (唐跃元)	1ms	8 MiB		91 Bytes	2023-5-11 18:58:18
AC	王康瑞	1ms	6.8 MiB		88 Bytes	2023-9-30 10:12:42
AC	陈佳婧	1ms	7 MiB		91 Bytes	2022-9-23 18:35:31
AC	煞笔笔	1ms	8.2 MiB		134 Bytes	2023-5-5 19:10:27
AC	gengyijun	1ms	6.9 MiB	C++11	97 Bytes	2024-4-19 19:53:17
AC	孙健涵 (hanhan090207)	1ms	8.2 MiB		77 Bytes	2023-5-7 18:10:41
AC	何定谦 (hdq)	1ms	6.7 MiB		99 Bytes	2023-9-2 8:51:16
AC	qinlang	1ms	8.1 MiB		88 Bytes	2023-5-13 19:18:12
AC	林昱霏	1ms	6.7 MiB		91 Bytes	2022-6-28 19:20:42
AC	郑qr	1ms	6.9 MiB	C++11	86 Bytes	2024-6-2 13:57:55
AC	徐子恩 (Cow)	1ms	8.2 MiB		91 Bytes	2022-1-18 22:29:30
AC	煞笔笔	1ms	8.2 MiB		134 Bytes	2023-5-5 19:10:27
AC	zhoujunlin	1ms	8.1 MiB		95 Bytes	2022-8-18 11:07:32
AC	陈博昊 (cbh)	1ms	8.2 MiB		122 Bytes	2023-5-5 19:21:47
AC	李允昊	1ms	6.5 MiB		94 Bytes	2023-9-4 21:07:05
AC	RanHao	1ms	6.8 MiB		188 Bytes	2023-11-4 10:55:30
AC	郑qr	1ms	6.8 MiB	C++11	86 Bytes	2024-6-2 13:59:37
AC	朱昱丞	1ms	7.6 MiB		105 Bytes	2022-5-15 17:56:22
AC	qinlang	1ms	8.1 MiB		88 Bytes	2023-5-13 19:18:27
AC	煞笔笔	1ms	8.2 MiB		134 Bytes	2023-5-5 19:10:32
AC	qinlang	1ms	8.1 MiB		88 Bytes	2023-5-13 19:18:27
AC	youhonglin	1ms	8.2 MiB		87 Bytes	2023-5-5 19:14:55
AC	煞笔笔	1ms	8.2 MiB		134 Bytes	2023-5-5 19:10:31
AC	赵耘毅	1ms	8.1 MiB		89 Bytes	2023-5-13 20:07:46
AC	陈杰晟 (王梓屹)	1ms	8 MiB		70 Bytes	2022-2-20 10:36:56
AC	孔妘蘂	1ms	8.2 MiB		92 Bytes	2023-5-5 19:20:02
AC	王子航	1ms	6.5 MiB		97 Bytes	2023-9-2 10:30:27
AC	朱老师 (zyp)	1ms	6.9 MiB		111 Bytes	2023-10-22 11:49:36
AC	Guest	1ms	7.2 MiB		79 Bytes	2023-10-28 11:28:16
AC	youhonglin	1ms	8.2 MiB		87 Bytes	2023-5-5 19:15:00
AC	李宜帆	1ms	8 MiB		93 Bytes	2023-2-28 18:14:59
AC	别啊！	1ms	7 MiB		114 Bytes	2022-2-19 17:35:33
AC	黄立信	1ms	7 MiB	C++98	128 Bytes	2024-6-7 17:34:36
AC	scott	1ms	7 MiB		84 Bytes	2022-2-18 20:35:37
AC	赵耘毅	1ms	8.1 MiB		89 Bytes	2023-5-13 20:07:41
AC	05c05-zzx	1ms	7.6 MiB		98 Bytes	2022-5-16 21:53:12
AC	煞笔笔	1ms	8.2 MiB		134 Bytes	2023-5-5 19:10:30
AC	城 (liqc)	1ms	7.3 MiB		74 Bytes	2022-9-17 14:26:50
AC	zhu	1ms	6.7 MiB		94 Bytes	2023-9-2 19:22:20
AC	叶哲宇 (yzy)	1ms	6.9 MiB		91 Bytes	2023-4-8 11:20:46
AC	cainuoyan	1ms	6.6 MiB		93 Bytes	2023-8-27 17:20:21
AC	wrz	1ms	6.5 MiB		94 Bytes	2023-9-3 17:30:29
AC	(张洛诚)	1ms	7.5 MiB		103 Bytes	2023-5-27 19:39:23
AC	游宏林1	1ms	7.7 MiB		98 Bytes	2023-6-28 11:52:19
AC	RanHao	1ms	7 MiB		169 Bytes	2023-10-28 10:56:21
AC	火焰麒麟 (李云舒)	1ms	6.5 MiB		90 Bytes	2023-9-1 19:41:43
AC	余晨浩 (yuchenhao)	1ms	8.1 MiB		88 Bytes	2022-8-24 15:34:33
AC	张猪猪	1ms	6.7 MiB		93 Bytes	2023-9-2 10:26:59
AC	AmberGao	1ms	7.3 MiB		102 Bytes	2023-6-11 13:58:07
AC	勾晨禹	1ms	6.8 MiB		89 Bytes	2023-10-20 19:26:56
AC	李哲 (lizhe)	1ms	8.2 MiB		76 Bytes	2022-1-5 21:55:37
AC	江政含	1ms	7.5 MiB		91 Bytes	2023-7-4 19:21:57
AC	时代一校-王宥量 (wangyouliang)	1ms	7.5 MiB		91 Bytes	2022-9-11 11:59:11
AC	Chanson	1ms	7.1 MiB		160 Bytes	2023-10-28 11:02:31
AC	朱老师 (zyp)	1ms	6.9 MiB		104 Bytes	2023-10-22 11:49:10
AC	赵耘毅	1ms	8.1 MiB		89 Bytes	2023-5-13 20:07:46
AC	wangyuanhong23005	1ms	6.5 MiB		93 Bytes	2023-8-26 14:28:45
AC	煞笔笔	1ms	8.2 MiB		134 Bytes	2023-5-5 19:10:37
AC	姚宏逸	1ms	7.8 MiB		92 Bytes	2023-2-27 19:24:41
AC	凌胥桐1	1ms	6.8 MiB		93 Bytes	2023-11-2 19:29:48
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		87 Bytes	2023-9-17 7:58:15
AC	罗竣瀚	1ms	8 MiB		87 Bytes	2022-9-24 15:16:33
AC	反恐鹅蛋 (反恐大大)	1ms	7.3 MiB		119 Bytes	2022-9-16 17:47:04
AC	zhuyvbing	1ms	7.7 MiB		94 Bytes	2022-10-29 11:25:32
AC	煞笔笔	1ms	8.2 MiB		134 Bytes	2023-5-5 19:10:24
AC	(张洛诚)	1ms	7.5 MiB		103 Bytes	2023-5-27 19:39:23
AC	赵耘毅	1ms	8.1 MiB		89 Bytes	2023-5-13 20:07:58
AC	赵耘毅	1ms	8.1 MiB		89 Bytes	2023-5-13 20:07:45
AC	黄俊乔	1ms	6.8 MiB		91 Bytes	2023-11-4 16:00:43
AC	赵耘毅	1ms	8.1 MiB		89 Bytes	2023-5-13 20:07:44
AC	陈荣添	1ms	8 MiB		86 Bytes	2023-5-13 19:17:03
AC	张家赫	1ms	7.8 MiB		92 Bytes	2023-2-28 18:19:15
AC	庹仕杰	1ms	6.8 MiB		98 Bytes	2023-9-9 14:09:50
AC	张家赫	1ms	7.8 MiB		92 Bytes	2023-2-28 18:19:10
AC	新一街校区-张煜果 (张煜果)	1ms	6.9 MiB	C++11	115 Bytes	2024-5-25 13:50:15
AC	在煎鱼的肖大总铳 (肖宇航)	1ms	8 MiB		93 Bytes	2022-2-22 20:44:37
AC	万欣悦	1ms	8.2 MiB		94 Bytes	2023-5-5 19:19:57
AC	(张洛诚)	1ms	7.5 MiB		103 Bytes	2023-5-27 19:39:23
AC	余多多29	1ms	7 MiB		93 Bytes	2023-4-4 22:34:14
AC	黎湘渝	1ms	8 MiB		93 Bytes	2023-2-28 18:18:09
AC	张濯弋	1ms	6.7 MiB		101 Bytes	2023-9-2 16:24:35
AC	李哲 (lizhe)	1ms	8.2 MiB		293 Bytes	2022-12-11 21:10:25
AC	罗一鸣	1ms	6.7 MiB		103 Bytes	2023-10-4 14:01:26
AC	黎湘渝	1ms	7.8 MiB		93 Bytes	2023-2-28 18:18:14
AC	测试账号	1ms	8 MiB		134 Bytes	2022-2-24 14:20:27
AC	youhonglin	1ms	8.2 MiB		87 Bytes	2023-5-5 19:14:59