输出ASCII码对应的符号

状态	递交者	时间	内存	语言	代码	递交时间
AC	陈杰晟	8ms	440 KiB		130 Bytes	2022-2-12 15:38:27
AC	益布响完辣 (黄靖益1)	8ms	7.1 MiB		122 Bytes	2023-7-7 15:07:08
AC	熊海阳 (xiongxaiyang)	8ms	6.9 MiB		115 Bytes	2023-7-12 13:34:36
AC	UsMt1 (jiangyuan)	8ms	7 MiB		96 Bytes	2023-7-20 16:20:18
AC	diaozhengyang	8ms	6.9 MiB		110 Bytes	2023-8-10 10:40:18
AC	龚铭俊 (哈哈哈)	8ms	448 KiB		130 Bytes	2023-1-8 11:12:34
AC	缥 (王硕2012)	8ms	512 KiB		134 Bytes	2022-9-28 21:08:27
AC	郑尧 (zhengyao)	8ms	428 KiB		112 Bytes	2023-3-16 20:08:05
AC	中岛敦 (黄麒瑞)	8ms	6.8 MiB		106 Bytes	2023-9-29 10:33:20
AC	六 (江智昕)	8ms	384 KiB		117 Bytes	2022-12-30 19:39:17
AC	jky1	8ms	432 KiB		137 Bytes	2023-3-19 15:33:58
AC	时代一校 - 范子煜 (范子煜)	8ms	6.9 MiB	C++20	102 Bytes	2024-8-18 17:29:43
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	8ms	436 KiB		120 Bytes	2022-11-24 18:08:37
AC	王胤钦 (wangyinqin)	8ms	432 KiB		113 Bytes	2022-8-26 17:47:46
AC	余晨浩 (yuchenhao)	8ms	384 KiB		101 Bytes	2022-8-24 15:24:09
AC	新壹街校区-罗斤天 (罗斤天)	8ms	6.9 MiB		96 Bytes	2023-7-9 8:29:04
AC	﹢•﹡🕉☽✝⚜Halanfus⚜✝☾⚔⚝﹡﹢• (黄子瑞)	8ms	6.9 MiB	C++98	112 Bytes	2024-8-20 13:30:39
AC	谢思睿	8ms	6.7 MiB		115 Bytes	2023-9-3 19:02:23
AC	A小涂	8ms	6.7 MiB		113 Bytes	2023-9-15 20:47:11
AC	何煜琦	8ms	6.7 MiB		106 Bytes	2023-8-27 11:59:29
AC	关博源	8ms	436 KiB		128 Bytes	2023-2-20 19:12:34
AC	新壹街校区-陈琬舒 (空空大师)	8ms	7.4 MiB		110 Bytes	2023-7-12 16:15:56
AC	六 (江智昕)	8ms	384 KiB		117 Bytes	2022-12-30 19:39:20
AC	天天happy	8ms	6.9 MiB		111 Bytes	2023-7-9 19:22:38
AC	时代一校-段老师：李云舒 (李云舒)	8ms	6.7 MiB		107 Bytes	2023-9-15 20:33:58
AC	Ricky	8ms	432 KiB		122 Bytes	2023-2-11 11:24:41
AC	何星震 (Jacob)	8ms	512 KiB		123 Bytes	2022-9-2 20:19:37
AC	邹曜丞 (13983097018)	8ms	392 KiB		112 Bytes	2023-4-15 19:59:30
AC	叶雨昊 (yeyuhao22006)	8ms	432 KiB		128 Bytes	2022-10-15 11:42:02
AC	yanglang	8ms	428 KiB		120 Bytes	2022-10-16 8:35:43
AC	叶雨昊 (yeyuhao22006)	8ms	440 KiB		123 Bytes	2023-2-24 19:04:24
AC	Tang	8ms	440 KiB		186 Bytes	2022-4-23 13:33:35
AC	郭人瑀作业号	8ms	428 KiB		130 Bytes	2022-8-2 14:27:10
AC	lihongyi	8ms	6.9 MiB		129 Bytes	2023-8-20 12:58:15
AC	zzl	8ms	6.9 MiB		113 Bytes	2023-7-11 14:31:08
AC	希蒙 (zhengxingya)	8ms	6.8 MiB		105 Bytes	2023-6-22 10:56:30
AC	六 (江智昕)	8ms	384 KiB		117 Bytes	2022-12-30 19:39:17
AC	SB (mfy01)	8ms	428 KiB		130 Bytes	2023-2-2 21:00:11
AC	执剑人罗辑 (Jasson)	8ms	512 KiB		110 Bytes	2022-10-1 18:14:52
AC	六 (江智昕)	8ms	384 KiB		117 Bytes	2022-12-30 19:39:20
AC	张祖名	8ms	7 MiB		124 Bytes	2023-7-7 19:51:16
AC	Nico	8ms	512 KiB		119 Bytes	2022-12-23 16:33:39
AC	甄一阳 (22016-zyy)	8ms	448 KiB		125 Bytes	2022-10-30 11:06:11
AC	邹曜丞 (13983097018)	8ms	384 KiB		112 Bytes	2023-4-15 19:59:29
AC	昌文迪 (05c05-cwd2)	8ms	436 KiB		111 Bytes	2022-11-26 16:33:41
AC	yuhaodi	8ms	436 KiB		92 Bytes	2023-4-15 18:53:01
AC	新壹街-曾浩坤 (曾浩坤)	8ms	7 MiB		109 Bytes	2023-7-21 8:31:52
AC	美术猫映画 (mkh)	8ms	6.9 MiB		100 Bytes	2023-7-18 19:04:13
AC	我是周靖松长得帅 (mouyunqi)	8ms	384 KiB		110 Bytes	2023-3-31 19:13:11
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)	8ms	440 KiB		140 Bytes	2022-11-24 20:42:33
AC	金天翊	8ms	7 MiB		118 Bytes	2024-1-20 14:36:57
AC	878698786086868789780	8ms	6.9 MiB		136 Bytes	2023-7-6 19:26:17
AC	RanHao	8ms	7.3 MiB		122 Bytes	2023-7-20 14:53:54
AC	JOKER (hhy)	8ms	432 KiB		106 Bytes	2023-4-15 9:41:21
AC	邵冠铖 (shaoguancheng22031)	8ms	436 KiB		97 Bytes	2022-9-26 21:24:02
AC	hnd (陈皓洋)	8ms	436 KiB		168 Bytes	2022-8-24 13:27:58
AC	郭征华第一忠实粉丝	8ms	512 KiB		111 Bytes	2022-7-22 21:24:10
AC	sb (吴振宇)	8ms	424 KiB		119 Bytes	2022-12-3 17:00:10
AC	苏晨懿	8ms	6.9 MiB		122 Bytes	2023-8-17 12:31:13
AC	李晨希	8ms	6.8 MiB		131 Bytes	2023-6-13 12:26:09
AC	xflt_dyp	8ms	6.9 MiB		121 Bytes	2023-7-22 14:56:21
AC	邓皓天 (1234567A)	8ms	6.9 MiB		135 Bytes	2023-7-7 19:45:16
AC	qinhaoxiang	8ms	7.1 MiB		114 Bytes	2024-1-20 12:56:19
AC	sunsihan	8ms	6.9 MiB		97 Bytes	2023-8-13 8:59:54
AC	杨皓宇 (杨浩宇)	8ms	408 KiB		119 Bytes	2022-8-7 17:52:15
AC	Aphrode	8ms	6.8 MiB		111 Bytes	2023-6-20 14:20:22
AC	益布响完辣 (黄靖益1)	8ms	7.1 MiB		122 Bytes	2023-7-7 15:07:16
AC	李卓燃	8ms	440 KiB		96 Bytes	2023-1-18 18:44:19
AC	邓智凌	8ms	6.9 MiB		190 Bytes	2023-7-6 19:26:57
AC	炸鱼4000+ (dxc)	8ms	6.9 MiB		116 Bytes	2023-6-30 19:57:08
AC	新壹街陈科言 (cky)	8ms	6.9 MiB		190 Bytes	2023-7-20 10:21:13
AC	duanxinghe	8ms	8 MiB		109 Bytes	2023-8-21 10:45:09
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	8ms	512 KiB		147 Bytes	2023-3-10 20:12:11
AC	万欣悦	8ms	384 KiB		135 Bytes	2023-5-19 19:28:05
AC	zzzhhhooonnnggg	8ms	540 KiB		104 Bytes	2023-3-19 18:16:36
AC	超级管理员 (root)	8ms	6.8 MiB		104 Bytes	2023-6-22 9:40:18
AC	在煎鱼的肖大总铳 (肖宇航)	8ms	7 MiB		150 Bytes	2023-6-4 9:12:07
AC	Microsoft (hu_moren)	8ms	6.9 MiB		127 Bytes	2023-7-29 14:20:35
AC	陈于硕(我™的) (chenyu)	8ms	7.2 MiB		126 Bytes	2023-7-3 11:16:28
AC	tyx_9192596	8ms	436 KiB		111 Bytes	2023-3-15 7:54:05
AC	huanglu	8ms	6.7 MiB		111 Bytes	2023-6-4 17:53:46
AC	新壹街校区--税崇峻 (税崇峻)	8ms	6.9 MiB		121 Bytes	2023-7-21 19:53:53
AC	余晨浩 (yuchenhao)	8ms	384 KiB		101 Bytes	2022-8-24 15:24:11
AC	新壹街罗田雨 (罗田雨29)	8ms	6.9 MiB		119 Bytes	2023-8-11 15:12:33
AC	chaikexu	8ms	440 KiB		108 Bytes	2022-11-13 11:05:11
AC	时代2校+施皓宬 (shihaocheng)	8ms	384 KiB		112 Bytes	2023-4-1 17:04:04
AC	小忙果 (王昱杰)	8ms	7.1 MiB		122 Bytes	2023-12-30 10:44:35
AC	雷诺伊尔 (崔金鹏)	8ms	7.3 MiB		125 Bytes	2024-1-2 21:13:47
AC	我很6 (zjj22031)	8ms	392 KiB		293 Bytes	2022-11-24 13:06:45
AC	一片落叶 (yeyuhao)	8ms	6.7 MiB		99 Bytes	2023-8-24 12:15:33
AC	22029-hqh	8ms	512 KiB		92 Bytes	2022-11-26 18:05:24
AC	德克萨斯做的到吗 (liyangbao)	8ms	436 KiB		175 Bytes	2022-10-24 17:24:41
AC	jdy (jdy.)	8ms	6.9 MiB		96 Bytes	2023-7-4 8:38:39
AC	啊...这 (炼狱杏寿郎)	8ms	432 KiB		120 Bytes	2023-1-11 16:14:48
AC	许徐非凡 (非同凡响)	8ms	7.5 MiB		106 Bytes	2023-7-20 19:45:24
AC	胡唯轶	8ms	7.2 MiB		113 Bytes	2023-12-29 17:58:42
AC	黄盛凯	8ms	384 KiB		117 Bytes	2023-4-30 15:34:41
AC	叶哲宇 (yzy)	8ms	6.9 MiB		115 Bytes	2023-7-3 18:47:16
AC	时代一校石博文 (shibowen)	8ms	7 MiB		112 Bytes	2023-12-18 21:38:45
AC	U城校区毕悦志 (byz)	8ms	7 MiB		117 Bytes	2023-11-19 15:39:49