【例2.1】Hello World

状态	递交者	时间	内存	语言	代码	递交时间
AC	时代2校-程俊燃 (chengjunran)	3ms	412 KiB		99 Bytes	2023-6-3 17:35:37
AC	孩纸	3ms	412 KiB		102 Bytes	2023-12-3 15:40:05
AC	周靖松 (ZhouJS)	3ms	412 KiB		87 Bytes	2023-6-17 15:45:27
AC	杜雨帆	3ms	500 KiB	C++11	100 Bytes	2024-6-27 18:22:27
AC	马浩宸 (mhc06)	3ms	412 KiB		97 Bytes	2023-7-21 8:27:26
AC	江科毅 (jky)	3ms	332 KiB		96 Bytes	2023-6-4 14:54:57
AC	吴宗骏	3ms	536 KiB	C++98	96 Bytes	2024-7-14 11:29:36
AC	https://www.minecraft.net/zh-hans (王振西)	3ms	412 KiB		97 Bytes	2023-6-5 21:37:25
AC	司雨来 (siyulai)	3ms	412 KiB		97 Bytes	2023-7-6 17:23:18
AC	时代一校-赵彦博 (zyb)	3ms	284 KiB		91 Bytes	2023-6-9 17:46:26
AC	小忙果 (王昱杰)	3ms	412 KiB		103 Bytes	2023-7-20 8:51:47
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)	3ms	412 KiB		95 Bytes	2023-6-3 19:28:28
AC	在煎鱼的肖大总铳 (肖宇航)	3ms	412 KiB		96 Bytes	2023-11-26 9:52:17
AC	唐良瑞 (22016-tlr01)	3ms	412 KiB		93 Bytes	2023-7-21 8:37:28
AC	https://www.minecraft.net/zh-hans (王振西)	3ms	412 KiB		97 Bytes	2023-6-5 21:36:48
AC	杨浩灵 (金坷拉)	3ms	412 KiB		93 Bytes	2023-7-19 11:01:41
AC	马渝杭 (mayuhang)	3ms	412 KiB		96 Bytes	2023-6-4 13:11:54
AC	22029-zjs	3ms	412 KiB		103 Bytes	2023-6-10 11:50:12
AC	赵奕铭	3ms	768 KiB	C++98	86 Bytes	2024-6-26 18:14:28
AC	章愉霖	3ms	412 KiB		95 Bytes	2023-6-4 17:00:43
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	3ms	412 KiB		99 Bytes	2023-6-4 9:18:52
AC	新壹街陈科言 (cky)	3ms	412 KiB		100 Bytes	2023-7-18 9:00:18
AC	xyc (谢雨宸)	3ms	284 KiB		96 Bytes	2023-6-4 10:27:33
AC	yuhaodi	3ms	412 KiB		101 Bytes	2023-6-4 9:41:00
AC	爱琴海校区-刁钲洋 (刁钲洋)	3ms	412 KiB		153 Bytes	2023-6-3 20:33:28
AC	坤坤荔枝小黑子 (zhonghaotian22006)	3ms	412 KiB		98 Bytes	2023-6-4 16:33:20
AC	时代校区-孔令皓 (konglinghao)	3ms	412 KiB		98 Bytes	2023-10-11 20:45:58
AC	坤坤荔枝小黑子 (zhonghaotian22006)	3ms	412 KiB		98 Bytes	2023-6-4 16:34:51
AC	罗云志 (luo_yunzhi)	3ms	284 KiB		98 Bytes	2023-6-6 19:34:43
AC	韩思辰 (hansichen)	3ms	412 KiB		87 Bytes	2023-6-9 18:50:22
AC	马渝杭 (mayuhang)	3ms	412 KiB		96 Bytes	2023-6-4 13:12:15
AC	文硕 (文硕1)	3ms	412 KiB		93 Bytes	2023-6-3 21:35:34
AC	时代一校-王宥量 (wangyouliang)	3ms	412 KiB		91 Bytes	2023-6-4 13:18:03
AC	孙烽轶 (sfy)	3ms	412 KiB		91 Bytes	2023-6-10 14:49:33
AC	金沙校区-蓝祥与 (蓝祥与)	3ms	412 KiB		91 Bytes	2023-6-17 15:51:23
AC	王祎辰 (wangyichen)	3ms	412 KiB		99 Bytes	2023-6-3 20:11:36
AC	时代二校-王盼兮 (wangpanxi)	3ms	284 KiB		97 Bytes	2023-11-26 10:29:48
AC	欧俊阳	3ms	412 KiB		86 Bytes	2023-6-9 18:51:30
AC	余晨浩 (yuchenhao)	3ms	412 KiB		88 Bytes	2023-6-3 18:00:28
AC	郑岐蔚	3ms	412 KiB		99 Bytes	2023-7-20 17:34:53
AC	章愉霖	3ms	412 KiB		95 Bytes	2023-6-4 16:23:42
AC	执剑人罗辑 (Jasson)	3ms	412 KiB		92 Bytes	2023-6-9 18:49:16
AC	罗云志 (luo_yunzhi)	3ms	412 KiB		98 Bytes	2023-6-6 17:25:33
AC	你猜呀	3ms	360 KiB		98 Bytes	2023-6-4 10:29:37
AC	22029-lsl	3ms	412 KiB		91 Bytes	2023-6-10 11:41:04
AC	王祎辰 (wangyichen)	3ms	332 KiB		99 Bytes	2023-6-3 19:32:24
AC	李廷旭 (litingxu)	3ms	412 KiB		97 Bytes	2023-6-4 15:35:26
AC	希蒙 (zhengxingya)	3ms	284 KiB		191 Bytes	2023-8-17 16:27:06
AC	李廷旭 (litingxu)	3ms	412 KiB		97 Bytes	2023-6-4 15:23:36
AC	xuziyn	3ms	284 KiB		93 Bytes	2023-9-3 17:45:35
AC	余晨浩 (yuchenhao)	3ms	412 KiB		91 Bytes	2023-6-4 16:13:58
AC	黄立信	3ms	324 KiB		93 Bytes	2023-9-20 19:29:53
AC	新壹街校区-周士杰 (zsj)	3ms	412 KiB		91 Bytes	2023-6-28 9:21:45
AC	明哲瀚 (18580067605)	3ms	412 KiB		86 Bytes	2023-6-3 18:00:32
AC	明哲瀚 (18580067605)	3ms	412 KiB		86 Bytes	2023-6-3 18:00:43
AC	新壹街校区-陈琬舒 (空空大师)	3ms	412 KiB		94 Bytes	2023-11-22 11:07:30
AC	章愉霖	3ms	412 KiB		95 Bytes	2023-6-4 16:27:13
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	3ms	412 KiB		98 Bytes	2023-6-28 18:13:05
AC	新壹街校区-罗斤天 (罗斤天)	3ms	412 KiB		164 Bytes	2023-7-10 18:25:19
AC	何昊宇 (22016-hhy)	3ms	412 KiB		96 Bytes	2023-7-29 19:57:52
AC	张雯皓 (zhangwenhao)	3ms	332 KiB		87 Bytes	2023-6-24 9:40:13
AC	时代二校-陈天成 (鸭缩毛巾)	3ms	412 KiB		99 Bytes	2023-6-3 17:43:00
AC	乐瀚阳 (yuehanyang)	3ms	412 KiB		92 Bytes	2023-6-10 15:01:34
AC	zhangxinyue	3ms	412 KiB		87 Bytes	2023-6-9 18:47:51
AC	(张洛诚)	3ms	412 KiB		96 Bytes	2023-7-10 11:58:40
AC	陈骏逸 (chenjunyi)	3ms	284 KiB		97 Bytes	2023-7-4 14:14:06
AC	李松泽 (lisongze)	3ms	412 KiB		132 Bytes	2023-6-4 13:20:49
AC	杜是贤 (dushixian)	3ms	412 KiB		96 Bytes	2023-7-30 12:40:59
AC	CK (李弘毅)	3ms	412 KiB		112 Bytes	2023-6-4 18:47:43
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	3ms	412 KiB		115 Bytes	2023-11-25 11:37:13
AC	沈煜恒 (一位老六)	3ms	412 KiB		92 Bytes	2023-10-22 11:21:53
AC	旷山 (15213268688)	3ms	412 KiB		102 Bytes	2023-6-4 10:30:56
AC	爱琴海校区-刁钲洋 (刁钲洋)	3ms	284 KiB		153 Bytes	2023-6-3 20:33:18
AC	胡澜之 (666hlz666)	3ms	412 KiB		95 Bytes	2023-7-10 18:31:39
AC	xuniaoyin (徐袅音)	3ms	284 KiB		94 Bytes	2023-12-27 21:25:03
AC	徐伟宸 (徐伟宸1)	3ms	412 KiB		97 Bytes	2023-12-29 21:59:55
AC	超级管理员 (root)	3ms	412 KiB		94 Bytes	2023-11-21 0:09:02
AC	老李爱国	3ms	412 KiB		96 Bytes	2023-8-23 9:14:40
AC	邹曜丞 (13983097018)	3ms	352 KiB		98 Bytes	2023-7-18 10:48:18
AC	dengduxi	3ms	284 KiB		86 Bytes	2023-6-6 18:23:26
AC	罗兰（漆黑襟默) (zhangxiaoci)	3ms	412 KiB		91 Bytes	2023-6-17 15:46:40
AC	杜雨帆	3ms	764 KiB	C++11	112 Bytes	2024-6-26 17:47:27
AC	疯神芭芭脱丝 (李卓修)	3ms	284 KiB		203 Bytes	2023-12-16 16:26:58
AC	孙嘉蔚	3ms	320 KiB	C++11	100 Bytes	2024-6-26 17:47:23
AC	UsMt1 (jiangyuan)	3ms	412 KiB		1.1 KiB	2023-7-20 16:47:08
AC	孩纸	3ms	284 KiB		97 Bytes	2023-12-3 15:39:35
AC	旷山 (15213268688)	3ms	412 KiB		102 Bytes	2023-6-23 12:52:07
AC	刘思齐	3ms	768 KiB	C++98	101 Bytes	2024-6-26 16:48:28
AC	杨瀚霖 (yanghanlin)	3ms	412 KiB		83 Bytes	2023-7-6 19:06:18
AC	张睎宇	4ms	324 KiB		94 Bytes	2024-1-22 11:10:03
AC	无尽的想象 (谭仕高)	4ms	536 KiB		94 Bytes	2024-1-19 13:12:59
AC	炸鱼4000+ (dxc)	7ms	412 KiB		97 Bytes	2023-9-19 17:34:55
AC	新壹街—熊轩杭 (xiongxuanhang)	13ms	2 MiB	PHP	11 Bytes	2023-12-9 18:15:52
AC	AV8D (yumingjie11)	29ms	3.6 MiB	Python 3	20 Bytes	2024-1-6 10:08:13
AC	朱老师 (zyp)	31ms	3.6 MiB	Python 3	20 Bytes	2024-1-12 14:47:36
AC	陈廷恩	33ms	3.3 MiB	Python 3	20 Bytes	2023-6-4 10:29:18
AC	CHINA__20000_CANADA	34ms	3.3 MiB	Python 3	20 Bytes	2023-8-21 13:40:02
AC	许炜铭 (xuweiming)	34ms	3.3 MiB	Python 3	20 Bytes	2023-6-4 14:08:09
AC	时代二校-焦雨齐 (Angel)	34ms	3.3 MiB	Python 3	20 Bytes	2023-6-3 17:45:45
AC	新壹街校区-杨轩懿 (杨轩懿1)	34ms	3.3 MiB	Python 3	20 Bytes	2023-6-4 8:57:19