含K个3的数

状态	递交者	时间	内存	语言	代码	递交时间
AC	繁星 (05c35-zzm)	27ms	384 KiB		301 Bytes	2022-9-11 10:27:05
AC	黄立信	27ms	6.8 MiB		369 Bytes	2023-10-15 13:21:23
AC	陈杰晟	27ms	384 KiB		345 Bytes	2022-3-1 18:52:14
AC	PP (彭锦华)	27ms	7 MiB	C++98(O2)	305 Bytes	2024-6-26 14:54:22
AC	无尽的想象 (谭仕高)	27ms	512 KiB		194 Bytes	2022-7-28 13:17:32
AC	蒋俊豪	27ms	6.8 MiB	C++11	338 Bytes	2024-8-25 14:56:26
AC	马渝杭 (mayuhang)	27ms	384 KiB		235 Bytes	2022-8-10 18:07:24
AC	段淏泷	27ms	7.1 MiB	C++98	296 Bytes	2024-6-22 14:26:41
AC	赵泳鑫 (zhaoyongxin)	27ms	444 KiB		257 Bytes	2022-4-19 18:48:08
AC	肖添宇	27ms	384 KiB		282 Bytes	2022-4-16 17:55:49
AC	繁星 (05c35-zzm)	27ms	384 KiB		85 Bytes	2022-9-11 10:22:12
AC	Tender. (05c05-zhou)	27ms	512 KiB		313 Bytes	2023-3-5 18:25:36
AC	郭人瑀作业号	27ms	512 KiB		253 Bytes	2022-8-2 15:18:43
AC	朱泽晟	27ms	384 KiB		244 Bytes	2022-2-13 12:12:31
AC	zry	27ms	384 KiB		269 Bytes	2022-9-11 10:24:11
AC	繁星 (05c35-zzm)	27ms	420 KiB		301 Bytes	2022-9-11 10:27:04
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)	27ms	428 KiB		658 Bytes	2022-11-23 21:13:07
AC	繁星 (05c35-zzm)	27ms	384 KiB		85 Bytes	2022-9-11 10:22:07
AC	繁星 (05c35-zzm)	28ms	384 KiB		85 Bytes	2022-9-11 10:22:11
AC	唐良瑞 (22016-tlr01)	28ms	384 KiB		275 Bytes	2023-5-7 11:40:51
AC	彭嘉豪 (pengjiahao)	28ms	440 KiB		297 Bytes	2023-2-16 21:03:01
AC	qwerty	28ms	392 KiB		366 Bytes	2022-3-11 21:47:09
AC	wuzhenghan	28ms	384 KiB		184 Bytes	2022-11-5 20:42:36
AC	leisixian (22029-lyh)	28ms	512 KiB		246 Bytes	2022-11-23 16:57:14
AC	wangxingyue	28ms	512 KiB		264 Bytes	2023-3-28 19:35:16
AC	Accepted (周芷乐)	28ms	7 MiB	C++14	241 Bytes	2024-5-30 18:54:10
AC	love GanYu (爱搞笑的张浩宇)	28ms	7 MiB	C++11	431 Bytes	2024-6-28 20:55:39
AC	dmh (丁墨涵)	28ms	436 KiB		263 Bytes	2022-2-14 20:24:01
AC	繁星 (05c35-zzm)	28ms	384 KiB		85 Bytes	2022-9-11 10:22:06
AC	诸禹吉 (zhuyuji)	28ms	7.2 MiB	C++98	247 Bytes	2024-5-12 10:13:37
AC	罗晨睿 (luochenrui)	28ms	444 KiB		382 Bytes	2022-6-29 13:27:52
AC	zhangyh (张育菡)	28ms	436 KiB		270 Bytes	2022-6-10 22:29:38
AC	xyc (谢雨宸)	28ms	7.1 MiB		255 Bytes	2023-12-3 9:56:31
AC	1396013295	28ms	396 KiB		285 Bytes	2022-1-25 19:01:10
AC	老六在此	28ms	7 MiB	C++20	397 Bytes	2024-8-23 17:41:19
AC	疯神芭芭脱丝 (李卓修)	28ms	512 KiB		238 Bytes	2022-7-12 11:17:07
AC	胡澜之 (666hlz666)	28ms	432 KiB		340 Bytes	2023-4-25 19:30:14
AC	繁星 (05c35-zzm)	28ms	392 KiB		85 Bytes	2022-9-11 10:22:11
AC	周子涵	28ms	384 KiB		209 Bytes	2022-10-1 16:30:36
AC	胡宸华 (huchenhua)	28ms	392 KiB		252 Bytes	2022-11-12 22:59:13
AC	文硕 (文硕1)	28ms	512 KiB		272 Bytes	2022-2-6 13:55:56
AC	(张洛诚)	28ms	444 KiB		342 Bytes	2023-5-13 19:39:55
AC	lch (凌昌瀚)	28ms	444 KiB		454 Bytes	2022-7-7 22:14:17
AC	姚宏逸	28ms	384 KiB		246 Bytes	2022-1-14 19:54:23
AC	王重道	28ms	512 KiB		292 Bytes	2022-4-16 15:30:14
AC	况奕辛 (KYX_yyds)	28ms	428 KiB		537 Bytes	2022-2-25 19:25:07
AC	坤坤荔枝小黑子 (zhonghaotian22006)	28ms	496 KiB		477 Bytes	2023-3-5 16:29:36
AC	繁星 (05c35-zzm)	28ms	392 KiB		301 Bytes	2022-9-11 10:27:03
AC	荣耀	28ms	6.7 MiB		321 Bytes	2023-9-9 15:05:42
AC	付柏乐	28ms	7.2 MiB	C++11	205 Bytes	2024-5-18 11:28:20
AC	朱老师 (zyp)	28ms	436 KiB		254 Bytes	2022-8-6 11:24:04
AC	伍行念 (wuxingnian)	28ms	6.7 MiB		587 Bytes	2023-9-25 17:19:50
AC	scallway	28ms	384 KiB		288 Bytes	2022-9-14 15:33:12
AC	杨镇宇	28ms	7.5 MiB	C++98	249 Bytes	2024-4-21 15:22:20
AC	ShenChuan	28ms	512 KiB		298 Bytes	2023-5-7 11:38:28
AC	芒苒忧 (廖迦南)	28ms	392 KiB		269 Bytes	2022-1-26 20:33:56
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	28ms	392 KiB		294 Bytes	2022-9-3 15:13:56
AC	蒲梓勋 (puzixun)	29ms	392 KiB		415 Bytes	2022-11-5 16:58:25
AC	_PXY_	29ms	392 KiB		371 Bytes	2022-1-26 14:11:46
AC	ycy	29ms	424 KiB		307 Bytes	2023-1-7 1:22:43
AC	Eric Zoe (05c35-zyr)	29ms	440 KiB		420 Bytes	2022-9-11 10:18:40
AC	殷语函	29ms	7.2 MiB	C++11	311 Bytes	2024-4-23 21:53:41
AC	李哲 (lizhe)	29ms	512 KiB		252 Bytes	2022-8-18 20:54:06
AC	繁星 (05c35-zzm)	29ms	384 KiB		85 Bytes	2022-9-11 10:22:06
AC	yuhaodi	29ms	512 KiB		283 Bytes	2023-5-11 16:12:19
AC	周浩楠 (开朗的周好难)	29ms	6.8 MiB		295 Bytes	2023-9-9 11:12:18
AC	chenxiyu	29ms	7 MiB		307 Bytes	2023-6-10 16:20:00
AC	靳博然 (jbr)	29ms	436 KiB		290 Bytes	2023-4-9 18:05:48
AC	陈雨泽1	29ms	512 KiB		382 Bytes	2023-2-18 11:21:35
AC	黄梓轩 (huangzixuan)	29ms	444 KiB		268 Bytes	2023-5-14 14:12:38
AC	高国瑞	29ms	6.9 MiB		222 Bytes	2023-7-16 17:54:33
AC	繁星 (05c35-zzm)	29ms	384 KiB		85 Bytes	2022-9-11 10:22:11
AC	许嘉恩 (xje22031)	29ms	6.9 MiB		324 Bytes	2023-9-9 11:00:41
AC	Eric Zoe (05c35-zyr)	29ms	392 KiB		420 Bytes	2022-9-11 10:21:25
AC	zzl	29ms	6.8 MiB		222 Bytes	2023-11-7 0:40:53
AC	吴俊成 (wujuncheng)	29ms	512 KiB		281 Bytes	2022-7-10 11:39:34
AC	没有此人 (akm)	29ms	6.8 MiB		315 Bytes	2023-11-24 15:59:25
AC	scallway	29ms	6.7 MiB		288 Bytes	2023-9-12 19:32:54
AC	冒牌陈杰晟【MOD】 (wed)	29ms	436 KiB		308 Bytes	2022-3-6 15:18:42
AC	何洋名 (heyangming)	29ms	6.7 MiB		280 Bytes	2023-9-9 15:11:25
AC	小忙果 (王昱杰)	29ms	6.9 MiB		245 Bytes	2023-7-18 8:39:31
AC	soha (武夷岩)	29ms	7 MiB		363 Bytes	2023-6-10 16:17:38
AC	孙烽轶 (sfy)	29ms	6.8 MiB		245 Bytes	2023-6-10 16:16:01
AC	时代一校林星宇 (lxy)	29ms	488 KiB		248 Bytes	2023-2-2 20:14:01
AC	曹元明	29ms	512 KiB		435 Bytes	2022-9-3 14:06:13
AC	Randy Marsh (杨子腾)	29ms	384 KiB		273 Bytes	2022-10-1 15:32:53
AC	源著校区-宋昊成 (马冬梅)	29ms	440 KiB		365 Bytes	2023-2-25 18:19:43
AC	灵光sans (wangchihao)	29ms	7 MiB		255 Bytes	2023-6-10 16:18:10
AC	贺睿林	29ms	6.7 MiB		369 Bytes	2023-9-9 15:06:28
AC	jddd	29ms	384 KiB		216 Bytes	2022-9-8 18:10:38
AC	UsMt1 (jiangyuan)	29ms	6.9 MiB		394 Bytes	2023-7-28 11:39:22
AC	22029-zjs	30ms	436 KiB		311 Bytes	2022-11-25 20:06:05
AC	¿¿¿??? (李睿瞳)	30ms	7 MiB		329 Bytes	2023-12-7 20:42:05
AC	杨颂恩 (yangsongen)	30ms	6.9 MiB		250 Bytes	2023-12-2 10:28:31
AC	乐瀚阳 (yuehanyang)	30ms	6.9 MiB		252 Bytes	2023-6-10 16:16:23
AC	繁星 (05c35-zzm)	30ms	384 KiB		85 Bytes	2022-9-11 10:22:10
AC	22029-lsl	30ms	384 KiB		340 Bytes	2022-11-25 19:48:03
AC	10255	30ms	384 KiB		337 Bytes	2023-3-17 19:44:02
AC	叶雨昊 (yeyuhao22006)	30ms	440 KiB		391 Bytes	2022-8-11 16:45:22
AC	田世瑞	30ms	6.9 MiB		214 Bytes	2023-11-26 13:23:56