分离整数的各个数

状态	递交者	时间	内存	语言	代码	递交时间
AC	姚宏逸	28ms	392 KiB		266 Bytes	2022-1-30 20:20:10
AC	郭人瑀作业号	28ms	512 KiB		149 Bytes	2022-8-2 14:54:20
AC	曲奇饼干	28ms	436 KiB		147 Bytes	2023-2-19 11:28:15
AC	罗晨睿 (luochenrui)	28ms	440 KiB		136 Bytes	2022-6-29 13:26:39
AC	无尽的想象 (谭仕高)	28ms	440 KiB		146 Bytes	2022-7-28 13:13:24
AC	陈泰羽 (chentaiyu)	28ms	384 KiB		162 Bytes	2023-4-7 19:09:09
AC	李卓燃 (李卓燃1)	28ms	384 KiB		145 Bytes	2023-4-7 19:06:40
AC	况奕辛 (KYX_yyds)	28ms	384 KiB		217 Bytes	2022-3-8 20:49:07
AC	疯神芭芭脱丝 (李卓修)	28ms	512 KiB		146 Bytes	2023-2-4 9:52:50
AC	侯治鋆	28ms	436 KiB		120 Bytes	2022-5-20 20:40:06
AC	明轩 (吕同学)	28ms	6.7 MiB	C++14(O2)	459 Bytes	2024-7-17 10:15:29
AC	张瑞博	28ms	7.5 MiB	C++11	142 Bytes	2024-4-21 16:23:26
AC	靳博然 (jbr)	28ms	512 KiB		168 Bytes	2023-4-9 18:05:37
AC	张梓辰 (DiaoDesi屌德斯)	28ms	444 KiB		176 Bytes	2022-9-14 19:41:28
AC	张梓浩 (zhangzihao)	28ms	392 KiB		163 Bytes	2023-3-29 20:36:13
AC	时代1校-杨宇轩 (杨宇轩)	28ms	412 KiB		164 Bytes	2023-4-1 9:35:20
AC	殷语函	28ms	6.9 MiB	C++11	222 Bytes	2024-8-23 21:46:06
AC	wangziji	28ms	392 KiB		129 Bytes	2023-2-25 16:57:31
AC	你猜呀	28ms	384 KiB		158 Bytes	2023-5-25 20:04:17
AC	chenyantong	28ms	384 KiB		160 Bytes	2023-4-7 19:06:08
AC	kim	28ms	384 KiB		153 Bytes	2023-4-7 19:13:19
AC	qwerty	28ms	512 KiB		236 Bytes	2022-3-11 21:31:15
AC	陈雨泽1	28ms	392 KiB		191 Bytes	2023-2-18 11:21:09
AC	AC[谭赫奕] (tanheyi)	28ms	512 KiB		158 Bytes	2023-4-1 11:29:34
AC	陈泰羽 (chentaiyu)	28ms	392 KiB		162 Bytes	2023-4-7 19:09:20
AC	陈泰羽 (chentaiyu)	28ms	384 KiB		162 Bytes	2023-4-7 19:09:19
AC	陈泰羽 (chentaiyu)	28ms	512 KiB		162 Bytes	2023-4-7 19:09:23
AC	徐康景 (dcm)	28ms	512 KiB		171 Bytes	2022-9-23 18:24:01
AC	文硕 (文硕1)	28ms	428 KiB		157 Bytes	2022-2-6 13:55:17
AC	李树崑 (lishukun)	28ms	444 KiB		176 Bytes	2022-8-3 17:44:40
AC	罗玮希1	28ms	388 KiB		144 Bytes	2023-4-7 19:14:07
AC	伍行念 (wuxingnian)	28ms	6.7 MiB		410 Bytes	2023-9-25 16:53:18
AC	坤坤荔枝小黑子 (zhonghaotian22006)	28ms	384 KiB		169 Bytes	2022-5-1 18:01:52
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)	28ms	440 KiB		213 Bytes	2023-5-16 19:24:38
AC	王重道	28ms	512 KiB		160 Bytes	2022-4-16 15:29:45
AC	陈泰羽 (chentaiyu)	29ms	392 KiB		162 Bytes	2023-4-7 19:09:18
AC	李林峰 (金克拉)	29ms	432 KiB		164 Bytes	2023-2-18 9:50:52
AC	姚宏逸	29ms	512 KiB		139 Bytes	2022-3-3 19:12:04
AC	陈泰羽 (chentaiyu)	29ms	504 KiB		162 Bytes	2023-4-7 19:09:24
AC	谭懿轩 (yanyixuan)	29ms	512 KiB		154 Bytes	2022-2-15 18:10:00
AC	陈泰羽 (chentaiyu)	29ms	400 KiB		162 Bytes	2023-4-7 19:09:23
AC	dmh (丁墨涵)	29ms	512 KiB		155 Bytes	2022-2-27 19:49:33
AC	杨皓宇 (yanghaoyu)	29ms	6.8 MiB		137 Bytes	2023-10-21 8:47:57
AC	李卓燃 (李卓燃1)	29ms	392 KiB		143 Bytes	2023-4-7 19:07:07
AC	新壹街校区-杨轩懿 (杨轩懿1)	29ms	6.7 MiB		1.3 KiB	2023-8-28 17:52:23
AC	陈泰羽 (chentaiyu)	29ms	384 KiB		162 Bytes	2023-4-7 19:09:25
AC	马渝杭 (mayuhang)	29ms	436 KiB		266 Bytes	2022-8-14 11:41:02
AC	只因 (yubohang23002)	29ms	7.1 MiB		152 Bytes	2024-1-18 19:52:58
AC	zhoumingze23017	29ms	6.7 MiB		164 Bytes	2023-8-31 15:26:34
AC	朱泽晟	29ms	512 KiB		139 Bytes	2022-2-13 12:10:16
AC	江坤锜	29ms	384 KiB		178 Bytes	2023-3-25 19:17:35
AC	陈骏逸 (chenjunyi)	29ms	392 KiB		181 Bytes	2022-11-13 10:37:57
AC	疯神芭芭脱丝 (李卓修)	29ms	440 KiB		163 Bytes	2022-7-12 11:16:41
AC	陈泰羽 (chentaiyu)	29ms	384 KiB		143 Bytes	2023-4-7 19:08:31
AC	源著校区-宋昊成 (马冬梅)	29ms	448 KiB		179 Bytes	2023-2-25 18:19:23
AC	吴俊成 (wujuncheng)	29ms	512 KiB		164 Bytes	2022-7-10 11:39:23
AC	miku (阳沐珊)	29ms	6.9 MiB		214 Bytes	2023-8-20 16:07:18
AC	葛琮扬	29ms	6.9 MiB		123 Bytes	2023-7-21 12:09:33
AC	凌肯 (lingken22006)	29ms	512 KiB		179 Bytes	2022-7-31 21:55:42
AC	朱老师 (zyp)	29ms	6.9 MiB		204 Bytes	2023-7-18 13:26:19
AC	黄立信	29ms	6.8 MiB		160 Bytes	2023-10-15 13:21:06
AC	pandap&a王皓宸 (WANGHAOCHEN)	29ms	444 KiB		318 Bytes	2023-2-24 18:21:12
AC	zvt_132 (任子轩)	29ms	6.7 MiB		141 Bytes	2023-9-23 15:12:27
AC	wangruibo20xh	29ms	6.8 MiB		161 Bytes	2023-11-7 12:19:58
AC	胡澜之 (666hlz666)	29ms	6.8 MiB		171 Bytes	2023-6-29 14:58:53
AC	经常消失 (小萝卜)	29ms	512 KiB		203 Bytes	2022-9-13 21:38:39
AC	杨瀚霖 (yanghanlin)	29ms	512 KiB		201 Bytes	2023-2-3 17:02:44
AC	huanglu	29ms	432 KiB		174 Bytes	2023-5-26 22:14:58
AC	陈泰羽 (chentaiyu)	29ms	392 KiB		162 Bytes	2023-4-7 19:09:17
AC	新壹街校区-周士杰 (zsj)	29ms	512 KiB		216 Bytes	2023-3-3 19:52:59
AC	17779	29ms	436 KiB		164 Bytes	2022-3-10 13:37:48
AC	南坪校区-郑力博 (zhenglibo23003)	29ms	6.9 MiB		165 Bytes	2023-7-18 13:29:40
AC	杜是贤 (dushixian)	29ms	540 KiB		136 Bytes	2022-7-17 14:56:28
AC	胡程禹	29ms	6.7 MiB		176 Bytes	2023-9-13 20:40:57
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	29ms	512 KiB		203 Bytes	2022-9-3 15:27:27
AC	呵呵呵 (陈思琦)	29ms	436 KiB		127 Bytes	2022-10-5 14:58:25
AC	彭崇鑫	29ms	436 KiB		155 Bytes	2022-10-22 13:53:30
AC	22016-oyc	30ms	440 KiB		143 Bytes	2023-4-30 10:38:46
AC	陈泰羽 (chentaiyu)	30ms	384 KiB		162 Bytes	2023-4-7 19:09:20
AC	新壹街.曾祥睿 (zxr)	30ms	6.7 MiB		166 Bytes	2023-9-14 20:58:43
AC	在煎鱼的肖大总铳 (肖宇航)	30ms	6.8 MiB		137 Bytes	2023-9-24 11:19:08
AC	lichenrui23010	30ms	6.7 MiB		128 Bytes	2023-8-25 10:28:14
AC	蒲梓勋 (puzixun)	30ms	512 KiB		158 Bytes	2022-11-13 10:11:56
AC	曹埊睿 (caodirui)	30ms	512 KiB		141 Bytes	2023-4-19 22:28:56
AC	ganlin1	30ms	6.7 MiB		153 Bytes	2023-6-7 13:35:31
AC	不怎么聪明的家伙 (贺俊楠)	30ms	6.7 MiB		157 Bytes	2023-8-30 11:40:01
AC	leisixian (22029-lyh)	30ms	416 KiB		150 Bytes	2023-3-12 10:42:36
AC	漆星语 (qixingyu)	30ms	6.8 MiB		134 Bytes	2023-7-1 9:33:58
AC	六 (江智昕)	30ms	436 KiB		172 Bytes	2023-2-25 12:03:02
AC	时代二校-焦雨齐 (Angel)	30ms	512 KiB		134 Bytes	2023-4-16 13:53:50
AC	吃小孩的viv_	30ms	7.2 MiB		134 Bytes	2023-7-18 17:24:32
AC	陈泰羽 (chentaiyu)	30ms	392 KiB		162 Bytes	2023-4-7 19:09:11
AC	陈泰羽 (chentaiyu)	30ms	412 KiB		162 Bytes	2023-4-7 19:09:11
AC	陈泰羽 (chentaiyu)	30ms	392 KiB		162 Bytes	2023-4-7 19:09:16
AC	何星震 (Jacob)	30ms	436 KiB		132 Bytes	2022-11-14 18:55:39
AC	陈泰羽 (chentaiyu)	30ms	392 KiB		162 Bytes	2023-4-7 19:09:22
AC	新壹街校区-杨轩懿 (杨轩懿1)	30ms	6.7 MiB		1.3 KiB	2023-8-28 17:52:07
AC	UsMt1 (jiangyuan)	30ms	6.9 MiB		212 Bytes	2023-7-28 11:33:44
AC	chen (peter)	30ms	432 KiB		308 Bytes	2023-2-18 17:08:59
AC	黄梓轩 (huangzixuan)	30ms	440 KiB		151 Bytes	2023-2-11 14:02:24