反向输出一个三位数

状态	递交者	时间	内存	语言	代码	递交时间
AC	张景豪	32ms	7 MiB		148 Bytes	2023-6-29 20:26:10
AC	龙猫	32ms	7.5 MiB		117 Bytes	2023-7-10 19:20:11
AC	叶哲宇 (yzy)	33ms	6.9 MiB		124 Bytes	2023-8-11 16:17:16
AC	tyx_9192596	33ms	512 KiB		126 Bytes	2023-3-16 7:27:14
AC	益布响完辣 (黄靖益1)	33ms	7 MiB		169 Bytes	2023-7-7 16:46:27
AC	x0l0x	33ms	6.6 MiB		160 Bytes	2023-11-22 11:12:22
AC	龚信丞	33ms	6.5 MiB		155 Bytes	2023-6-3 20:18:00
AC	时代2校-程俊燃 (chengjunran)	33ms	384 KiB		173 Bytes	2023-4-8 16:25:47
AC	三差学生 (尘埃蓝莓)	33ms	7.4 MiB		200 Bytes	2023-7-7 12:02:22
AC	孙烽轶 (sfy)	33ms	7.1 MiB		114 Bytes	2023-7-3 16:25:13
AC	赵启程 (赵启程1)	33ms	512 KiB		144 Bytes	2023-3-27 19:16:00
AC	22029-lsl	34ms	512 KiB		175 Bytes	2022-11-25 17:14:48
AC	胡澜之 (666hlz666)	34ms	7.1 MiB		125 Bytes	2023-7-7 19:53:06
AC	没有此人 (akm)	34ms	7 MiB		173 Bytes	2023-12-8 16:35:02
AC	Corinna	34ms	6.7 MiB		233 Bytes	2023-8-23 13:27:58
AC	邹曜丞 (13983097018)	34ms	7.4 MiB		149 Bytes	2023-7-3 10:45:27
AC	新一街校区Jason_LuoYouZheng (罗友峥)	34ms	444 KiB		229 Bytes	2023-1-19 16:30:15
AC	郑岐蔚	34ms	512 KiB		154 Bytes	2023-1-26 14:05:32
AC	Error404sans (焦阳浩云)	35ms	544 KiB		126 Bytes	2023-1-14 16:01:05
AC	南坪校区-淡昌盛 (Dancs)	35ms	7.2 MiB		142 Bytes	2023-12-30 10:48:13
AC	周浩楠 (开朗的周好难)	35ms	8.2 MiB		167 Bytes	2023-8-22 22:33:04
AC	赵奕铭	35ms	7.3 MiB		184 Bytes	2024-1-20 15:19:12
AC	高彬月	35ms	7 MiB		154 Bytes	2023-12-10 22:10:57
AC	周琪渃	35ms	384 KiB		180 Bytes	2022-11-27 16:41:25
AC	river	35ms	512 KiB		154 Bytes	2022-10-9 14:14:39
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)	35ms	392 KiB		179 Bytes	2022-11-23 20:17:03
AC	煞笔笔	36ms	7.2 MiB		151 Bytes	2023-11-25 21:29:43
AC	本人天生贪生pass (05c41-cqs)	37ms	6.9 MiB		121 Bytes	2023-7-30 16:23:25
AC	wanghuaiying	37ms	7.1 MiB		153 Bytes	2023-11-11 10:41:19
AC	纪承熙 (jcx001)	37ms	7.2 MiB		143 Bytes	2023-12-9 9:54:04
AC	RanHao	37ms	6.9 MiB		138 Bytes	2023-7-20 15:44:29
AC	叶雨昊 (yeyuhao22006)	38ms	452 KiB		192 Bytes	2022-11-15 14:06:36
AC	新壹街罗田雨 (罗田雨29)	38ms	6.9 MiB		156 Bytes	2023-8-5 9:14:10
AC	周米骐 (zsb)	39ms	6.8 MiB		183 Bytes	2023-7-19 9:24:36
AC	zyb小号	39ms	7 MiB		155 Bytes	2024-1-14 13:36:21
AC	wangziji	40ms	424 KiB		123 Bytes	2022-11-2 19:27:17
AC	杨馨涵	40ms	6.9 MiB		127 Bytes	2023-11-29 20:21:25
AC	在煎鱼的肖大总铳 (肖宇航)	40ms	512 KiB		208 Bytes	2023-3-17 21:35:22
AC	那吒 (yuchenyi23017)	40ms	7 MiB		129 Bytes	2023-12-3 10:58:11
AC	李彦臻	41ms	7 MiB		153 Bytes	2024-1-6 15:17:46
AC	https://www.crazygames.com/game/merge-construct (陈诺)	44ms	7.2 MiB		171 Bytes	2023-12-16 15:41:59
AC	AI创客	45ms	6.7 MiB		117 Bytes	2023-11-20 22:04:19
AC	邱越	48ms	7.3 MiB		169 Bytes	2024-1-5 20:56:34
AC	ChongqingGroup (Donce)	49ms	6.9 MiB		168 Bytes	2023-11-23 18:35:23
AC	小忙果 (王昱杰)	50ms	7.1 MiB		148 Bytes	2023-12-30 10:56:04
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	51ms	7 MiB		122 Bytes	2023-11-25 11:03:10
AC	zyl	52ms	7.3 MiB		151 Bytes	2024-1-3 15:30:26
AC	AV8D (yumingjie11)	53ms	7.3 MiB		156 Bytes	2023-12-30 18:43:14
AC	wuenzi	118ms	536 KiB		123 Bytes	2024-3-9 10:57:08
AC	只因 (yubohang23002)	122ms	764 KiB		147 Bytes	2024-3-2 14:18:32
AC	Guest	123ms	536 KiB		122 Bytes	2024-3-7 19:52:40
AC	1 (高梓睿23025)	123ms	764 KiB		134 Bytes	2024-4-14 13:53:02
AC	jianxinming	127ms	764 KiB		111 Bytes	2024-2-2 21:36:51
AC	¿¿¿??? (李睿瞳)	128ms	764 KiB		133 Bytes	2024-1-27 13:17:38
AC	cola	129ms	788 KiB		264 Bytes	2024-3-8 16:42:11
AC	黄立信是XXS (吕同学)	130ms	536 KiB		421 Bytes	2024-2-23 20:04:24
AC	刘灵熙	130ms	764 KiB		138 Bytes	2024-3-31 11:24:19
AC	王启仑 (wangqilun23010)	131ms	764 KiB		137 Bytes	2024-3-15 20:08:14
AC	Noah (mwx)	131ms	536 KiB		1.4 KiB	2024-3-14 18:35:31
AC	xsm梁家畅	132ms	764 KiB	C++98(O2)	164 Bytes	2025-1-15 19:08:23
AC	金沙校区-李嘉齐 (李嘉齐)	132ms	768 KiB		129 Bytes	2024-2-18 19:09:46
AC	U城校区-邓皓月 (邓皓月)	133ms	764 KiB		191 Bytes	2024-2-20 20:39:04
AC	fjx	134ms	536 KiB		162 Bytes	2024-3-9 13:19:14
AC	洛阳锦程 (郭思利)	134ms	548 KiB		142 Bytes	2024-3-17 9:38:43
AC	zhongjunxuan	135ms	764 KiB		167 Bytes	2024-2-23 18:23:50
AC	金沙-文豪 (wenhao)	135ms	544 KiB		148 Bytes	2024-4-6 11:08:07
AC	Iodef (OP AI)	135ms	764 KiB		133 Bytes	2024-1-25 11:36:33
AC	张祖名	135ms	772 KiB		140 Bytes	2024-3-17 10:44:13
AC	yangyao	135ms	764 KiB	C++98(O2)	126 Bytes	2025-2-2 15:50:09
AC	wangzihang3	136ms	532 KiB		397 Bytes	2024-2-13 17:48:02
AC	yh1	136ms	772 KiB		143 Bytes	2024-3-5 20:46:10
AC	编程小黑№ (叶睿)	136ms	764 KiB	C++14	118 Bytes	2025-1-17 16:04:05
AC	李允昊	136ms	768 KiB		133 Bytes	2024-2-17 11:48:37
AC	A小涂	139ms	584 KiB	C++17	156 Bytes	2025-1-11 15:59:07
AC	你个你怎么跟个一样 (钟卓劭)	139ms	764 KiB		162 Bytes	2024-2-7 15:39:04
AC	赵耘毅	140ms	764 KiB	C++98	136 Bytes	2025-1-11 18:30:02
AC	xsm李晟睿	140ms	536 KiB	C++98(O2)	173 Bytes	2025-1-21 15:56:36
AC	xsm肖奕辰	140ms	532 KiB	C++11	119 Bytes	2025-2-13 13:40:03
AC	shishen	141ms	764 KiB	C++98	156 Bytes	2025-2-17 10:09:50
AC	xsm陈思齐	141ms	764 KiB	C++98(O2)	111 Bytes	2025-1-20 13:39:38
AC	叶令子	141ms	764 KiB	C++11	161 Bytes	2025-2-9 14:16:31
AC	黄力宏	141ms	544 KiB	C++98(O2)	131 Bytes	2025-1-28 13:29:10
AC	xsm谢吉童	143ms	628 KiB	C++98(O2)	166 Bytes	2025-2-16 12:52:03
AC	蒲昊	143ms	768 KiB	C++17	149 Bytes	2025-1-11 19:23:00
AC	xsm李子洋	144ms	532 KiB	C++14	187 Bytes	2025-3-11 13:05:53
AC	商珉瑞	145ms	768 KiB	C++98	206 Bytes	2025-1-11 13:36:38
AC	xsm郑世檄	145ms	552 KiB	C++98(O2)	142 Bytes	2025-3-29 21:56:11
AC	uiuy (李潇睿666)	146ms	768 KiB	C++98(O2)	145 Bytes	2025-3-5 13:36:34
AC	奶龙 (hterberjh4ewjn54hgbh4)	147ms	536 KiB	C++20(O2)	285 Bytes	2025-3-28 15:34:05
AC	褚博艺	147ms	768 KiB	C++11	181 Bytes	2025-1-11 9:06:19
AC	武栯铖	147ms	764 KiB	C++98(O2)	304 Bytes	2025-3-31 13:11:01
AC	王子昕(scallway)	147ms	768 KiB	C++11	162 Bytes	2025-1-12 10:02:32
AC	算法战神 (konglinghao)	149ms	764 KiB		125 Bytes	2024-4-9 8:47:35
AC	武栯铖54188	149ms	768 KiB	C++20	283 Bytes	2025-3-20 13:24:40
AC	xqc125	150ms	760 KiB	C++98	154 Bytes	2025-2-26 19:15:46
AC	费治铭	153ms	768 KiB	C++98(O2)	173 Bytes	2025-3-5 13:34:11
AC	新壹街校区-冉睦阳（想要无敌天下吗，葵花宝典有售，不要18880，只要9999） (冉睦阳)	156ms	764 KiB	C++98	226 Bytes	2025-3-8 15:57:36
AC	吴俊成 (wujuncheng)	173ms	2.9 MiB	Python 2	69 Bytes	2022-7-8 22:52:12
AC	. (Pig)	175ms	2.9 MiB	Python 2	37 Bytes	2022-1-21 13:41:23
AC	龚泉05	239ms	9.5 MiB	Python 3	27 Bytes	2024-5-10 19:34:14