数的输入和输出

状态	递交者	时间	内存	语言	代码	递交时间
AC	陈蓟泽 (chenjize)	13ms	512 KiB		168 Bytes	2022-6-2 20:40:05
AC	11111	13ms	384 KiB		149 Bytes	2022-3-20 9:22:54
AC	罗宇凡 (吴彦祖)	13ms	384 KiB		140 Bytes	2022-3-13 20:03:08
AC	Yin2009	13ms	384 KiB		170 Bytes	2022-9-11 11:14:48
AC	yanxiaosong	13ms	384 KiB		151 Bytes	2022-6-5 16:57:25
AC	yangbinyu	13ms	384 KiB		147 Bytes	2022-9-7 19:53:59
AC	zjm	13ms	384 KiB		146 Bytes	2023-2-26 12:00:50
AC	cheers 戴 (daizhuorun)	13ms	384 KiB		187 Bytes	2022-8-28 16:19:17
AC	wangshuo	13ms	384 KiB		182 Bytes	2022-9-11 11:20:43
AC	zjm	14ms	384 KiB		146 Bytes	2023-2-26 12:00:40
AC	11451254188 (22029-mjh)	14ms	448 KiB		163 Bytes	2022-11-20 19:20:59
AC	曾维思	14ms	7.2 MiB	C++98	142 Bytes	2024-5-18 19:09:32
AC	刘沄熙	14ms	384 KiB		144 Bytes	2022-9-11 16:19:44
AC	yu (赵子瑜)	14ms	384 KiB		154 Bytes	2022-3-15 20:26:20
AC	yucaoluyang22006	14ms	392 KiB		138 Bytes	2023-3-4 18:47:50
AC	周米骐 (zsb)	14ms	384 KiB		148 Bytes	2023-5-16 19:59:15
AC	zhoujunlin	14ms	384 KiB		176 Bytes	2022-9-11 11:29:39
AC	雷文博（帅哥） (18983951391)	14ms	392 KiB		172 Bytes	2023-3-12 15:22:33
AC	ycy	14ms	404 KiB		142 Bytes	2022-4-22 17:43:03
AC	姚宏逸	14ms	432 KiB		136 Bytes	2022-3-18 19:50:42
AC	yuandingyang22031	14ms	436 KiB		135 Bytes	2023-2-26 12:00:54
AC	汤杰尧 (05c05-tjy1)	14ms	384 KiB		152 Bytes	2022-6-9 21:46:17
AC	胡瀚文	14ms	428 KiB		132 Bytes	2022-7-12 18:28:23
AC	汪子铭	14ms	384 KiB		161 Bytes	2022-10-30 12:16:54
AC	周米骐 (zsb)	14ms	384 KiB		147 Bytes	2023-5-16 19:59:01
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	14ms	384 KiB		147 Bytes	2023-2-26 12:24:09
AC	hyh22031	14ms	412 KiB		140 Bytes	2023-2-26 12:00:01
AC	soha (武夷岩)	14ms	384 KiB		148 Bytes	2022-8-31 19:08:38
AC	周米骐 (zsb)	14ms	384 KiB		148 Bytes	2023-5-16 19:59:17
AC	王星皓	14ms	384 KiB		148 Bytes	2022-10-30 12:18:22
AC	zhangzhimo	14ms	384 KiB		142 Bytes	2022-9-13 18:40:49
AC	yu (赵子瑜)	14ms	392 KiB		154 Bytes	2022-3-15 20:26:20
AC	坤坤荔枝小黑子 (zhonghaotian22006)	14ms	436 KiB		162 Bytes	2022-7-1 8:57:06
AC	huyinuo	14ms	424 KiB		157 Bytes	2022-5-8 10:07:14
AC	sunyichen	14ms	392 KiB		217 Bytes	2023-2-17 17:42:15
AC	逯典恩-113	14ms	384 KiB		189 Bytes	2022-8-28 18:25:23
AC	暗蛆突围 (lzh)	14ms	392 KiB		135 Bytes	2022-8-26 16:52:18
AC	13668050628	14ms	512 KiB		135 Bytes	2023-2-26 17:36:05
AC	谢靳骁 (XJX)	14ms	436 KiB		134 Bytes	2023-5-19 17:59:31
AC	yiqiuyu	14ms	392 KiB		149 Bytes	2023-3-4 18:36:43
AC	杨子力	14ms	400 KiB		153 Bytes	2022-3-13 20:22:38
AC	杨皓迪	14ms	420 KiB		146 Bytes	2022-8-31 19:08:36
AC	王晨志 (wangchenzhi)	14ms	432 KiB		147 Bytes	2022-7-22 15:14:18
AC	许嘉恩 (xje22031)	14ms	436 KiB		157 Bytes	2022-11-19 21:21:26
AC	yu (赵子瑜)	14ms	384 KiB		154 Bytes	2022-3-15 20:26:17
AC	史韵哲	14ms	440 KiB		128 Bytes	2023-2-20 22:17:05
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)	14ms	384 KiB		157 Bytes	2022-11-19 16:53:40
AC	wuqi	14ms	392 KiB		150 Bytes	2022-5-29 17:32:19
AC	kongql	14ms	7 MiB	C++11	164 Bytes	2024-5-30 16:39:59
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	14ms	512 KiB		126 Bytes	2022-12-2 20:08:59
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	14ms	392 KiB		147 Bytes	2023-2-26 12:24:08
AC	1396013295	14ms	392 KiB		156 Bytes	2022-3-20 11:23:25
AC	彭崇鑫	14ms	384 KiB		167 Bytes	2022-8-28 10:06:14
AC	周米骐 (zsb)	14ms	392 KiB		148 Bytes	2023-5-16 19:59:12
AC	NJL (NJlL)	14ms	436 KiB		220 Bytes	2022-6-26 17:58:42
AC	江子墨	14ms	6.9 MiB	C++98	147 Bytes	2024-6-27 10:04:19
AC	杨淇瑞 (杨淇瑞29)	14ms	7.2 MiB	C++98	179 Bytes	2024-5-15 20:38:49
AC	曾龙兮	14ms	384 KiB		161 Bytes	2022-8-28 10:05:08
AC	chenrunxiang22031	14ms	384 KiB		142 Bytes	2023-3-5 12:07:34
AC	金沙校区-先珂熠 (九转大肠)	14ms	6.9 MiB	C++20(O2)	154 Bytes	2024-8-16 10:43:16
AC	yu (赵子瑜)	14ms	512 KiB		154 Bytes	2022-3-15 20:26:21
AC	阮 (媚狐不吃道旁李)	14ms	488 KiB		149 Bytes	2023-3-5 16:54:20
AC	缥 (王硕2012)	14ms	384 KiB		157 Bytes	2022-11-6 12:24:57
AC	yangbinyu	14ms	384 KiB		147 Bytes	2022-9-7 19:53:58
AC	凌肯 (lingken22006)	14ms	384 KiB		154 Bytes	2022-12-4 20:12:43
AC	yangbinyu	14ms	392 KiB		147 Bytes	2022-9-7 19:53:57
AC	22029-lsl	14ms	436 KiB		145 Bytes	2022-11-20 19:15:03
AC	05c05-lyx	14ms	512 KiB		157 Bytes	2022-6-9 20:50:21
AC	唐梓竣	14ms	384 KiB		202 Bytes	2022-8-23 20:35:58
AC	SHY20091224	14ms	384 KiB		131 Bytes	2022-8-31 14:32:44
AC	wangjunhan	14ms	392 KiB		193 Bytes	2022-8-28 10:00:56
AC	谢博文	14ms	412 KiB		174 Bytes	2022-3-15 20:25:25
AC	王胤钦 (wangyinqin)	14ms	404 KiB		134 Bytes	2022-8-26 16:51:24
AC	leisixian (22029-lyh)	14ms	440 KiB		166 Bytes	2022-11-19 17:16:20
AC	USSR slq (USSR)	14ms	384 KiB		146 Bytes	2022-5-22 15:28:15
AC	kin of kin (jojo)	14ms	436 KiB		175 Bytes	2022-3-21 17:35:17
AC	李谨严	14ms	392 KiB		157 Bytes	2022-8-28 13:57:24
AC	易久竣	14ms	384 KiB		189 Bytes	2022-9-11 11:18:39
AC	yu (赵子瑜)	14ms	384 KiB		154 Bytes	2022-3-15 20:26:21
AC	刘昱辰	14ms	384 KiB		164 Bytes	2022-8-26 15:08:58
AC	ttt123	14ms	452 KiB		140 Bytes	2022-11-20 16:40:37
AC	yangbinyu	14ms	384 KiB		147 Bytes	2022-9-7 19:53:58
AC	zhm123	14ms	444 KiB		160 Bytes	2022-8-31 17:03:34
AC	ywh	14ms	440 KiB		155 Bytes	2022-7-31 14:31:00
AC	zjm	14ms	384 KiB		146 Bytes	2023-2-26 12:01:05
AC	zhangxinchen	14ms	384 KiB		150 Bytes	2022-9-14 19:44:21
AC	周米骐 (zsb)	14ms	392 KiB		148 Bytes	2023-5-16 19:59:17
AC	潘佑实	14ms	436 KiB		128 Bytes	2023-2-15 18:51:40
AC	张景豪	14ms	6.9 MiB		144 Bytes	2023-7-1 19:32:50
AC	yangbinyu	14ms	392 KiB		147 Bytes	2022-9-7 19:53:54
AC	唐梓竣	14ms	384 KiB		201 Bytes	2022-8-23 20:32:43
AC	郑尧 (zhengyao)	14ms	6.9 MiB		148 Bytes	2023-7-1 19:31:34
AC	张瑞博	14ms	7.1 MiB	C++11	131 Bytes	2024-4-20 23:35:14
AC	zlx (xiao)	14ms	432 KiB		155 Bytes	2022-11-26 21:19:45
AC	yangbinyu	14ms	392 KiB		147 Bytes	2022-9-7 19:53:57
AC	蒋青峰	14ms	436 KiB		112 Bytes	2023-2-26 10:16:04
AC	scallway1	14ms	440 KiB		149 Bytes	2022-8-28 9:53:26
AC	CK (李弘毅)	14ms	392 KiB		167 Bytes	2022-8-31 19:07:11
AC	xuniaoyin (徐袅音)	14ms	6.7 MiB		167 Bytes	2023-8-28 11:16:38
AC	yangbinyu	14ms	384 KiB		147 Bytes	2022-9-7 19:53:54