统计指定数字出现的次数

状态	递交者	时间	内存	语言	代码	递交时间
AC	时代2校-程俊燃 (chengjunran)	17ms	384 KiB		223 Bytes	2023-4-29 17:29:41
AC	草\|\|草 (陈星佑)	17ms	384 KiB		297 Bytes	2022-6-30 11:03:20
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	17ms	384 KiB		240 Bytes	2022-5-28 19:26:49
AC	新壹街校区--税崇峻 (税崇峻)	17ms	6.8 MiB		256 Bytes	2023-10-11 22:33:14
AC	时代二校+马嘉宸 (majiachen)	17ms	444 KiB		276 Bytes	2023-4-29 17:29:02
AC	wangjunhan	17ms	392 KiB		273 Bytes	2022-5-28 20:13:16
AC	甄一阳 (22016-zyy)	17ms	384 KiB		244 Bytes	2022-9-21 18:52:25
AC	任童(rentong)	17ms	384 KiB		280 Bytes	2022-8-15 20:47:31
AC	梅子楠 (22016-mzn)	17ms	384 KiB		266 Bytes	2022-9-18 9:42:51
AC	孔妘蘂	17ms	6.7 MiB		269 Bytes	2023-10-1 16:52:27
AC	cheers 戴 (daizhuorun)	17ms	384 KiB		358 Bytes	2022-3-16 21:22:21
AC	陈红恺 (chk)	17ms	384 KiB		241 Bytes	2022-7-1 19:36:07
AC	yzl2	17ms	392 KiB		250 Bytes	2023-4-29 19:53:30
AC	罗晨睿 (luochenrui)	17ms	384 KiB		251 Bytes	2022-6-29 14:23:56
AC	新一街校区Jason_LuoYouZheng (罗友峥)	17ms	384 KiB		289 Bytes	2022-5-28 19:15:04
AC	lch (凌昌瀚)	17ms	392 KiB		255 Bytes	2022-6-3 20:29:32
AC	樊竣熠 (lft1114)	17ms	448 KiB		248 Bytes	2022-8-11 10:10:20
AC	朱昱丞	17ms	384 KiB		319 Bytes	2022-6-5 19:45:09
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)	17ms	504 KiB		301 Bytes	2022-12-9 17:53:52
AC	可爱的小花狗	17ms	392 KiB		260 Bytes	2023-4-29 17:38:50
AC	冉宸语	17ms	6.7 MiB		257 Bytes	2023-10-1 15:16:04
AC	杨滨郝 (ybh)	17ms	384 KiB		275 Bytes	2022-7-27 9:07:49
AC	陈泰羽 (chentaiyu)	17ms	384 KiB		277 Bytes	2023-3-3 20:32:10
AC	时代二校+王吕棪 (wanglvyan)	17ms	384 KiB		238 Bytes	2023-4-29 17:25:14
AC	余彦瑞	17ms	384 KiB		257 Bytes	2022-6-26 10:37:13
AC	伍芷函	17ms	384 KiB		275 Bytes	2023-3-5 11:51:08
AC	曹元明	17ms	400 KiB		316 Bytes	2022-6-30 11:28:45
AC	孟子轩 (km老冯)	17ms	384 KiB		244 Bytes	2022-6-14 19:31:01
AC	原著校区巫映秋 (巫映秋1a)	17ms	384 KiB		230 Bytes	2023-4-5 15:07:20
AC	CPL	17ms	384 KiB		224 Bytes	2022-5-3 17:04:52
AC	靳博然 (jbr)	17ms	384 KiB		270 Bytes	2023-5-14 17:29:40
AC	陈佳婧	17ms	384 KiB		242 Bytes	2022-9-9 20:25:55
AC	郑之策	17ms	384 KiB		217 Bytes	2022-5-26 19:45:28
AC	三藏的痔疮 (不会玩是原罪)	17ms	392 KiB		275 Bytes	2022-1-22 11:29:53
AC	ycy	17ms	384 KiB		290 Bytes	2022-6-17 13:13:25
AC	食不食油饼（点主页康康） (Nemo)	17ms	384 KiB		246 Bytes	2022-9-4 18:44:40
AC	李樊駁	17ms	6.7 MiB		228 Bytes	2023-9-10 15:33:55
AC	王子恩	17ms	384 KiB		242 Bytes	2022-9-9 20:32:55
AC	时代二校-陈天成 (鸭缩毛巾)	17ms	384 KiB		228 Bytes	2023-4-29 17:27:05
AC	吴俊成 (wujuncheng)	17ms	408 KiB		244 Bytes	2022-6-5 17:30:25
AC	XYZ303	17ms	512 KiB		254 Bytes	2022-1-19 8:58:53
AC	草\|\|草 (陈星佑)	17ms	392 KiB		297 Bytes	2022-6-30 11:03:22
AC	15923339325	17ms	404 KiB		239 Bytes	2022-7-1 19:36:48
AC	喵 (蹇心悦)	17ms	384 KiB		247 Bytes	2022-9-24 16:04:44
AC	游智棋	17ms	6.9 MiB	C++17	267 Bytes	2024-6-22 19:52:56
AC	SYC0226	17ms	384 KiB		249 Bytes	2022-3-20 14:02:08
AC	杜俊宏	17ms	412 KiB		255 Bytes	2022-3-26 16:41:10
AC	陈一锋 (cyf01)	18ms	384 KiB		295 Bytes	2022-7-1 20:02:33
AC	soha (武夷岩)	18ms	384 KiB		239 Bytes	2023-4-15 15:18:41
AC	明轩 (吕同学)	18ms	6.6 MiB	C++14(O2)	440 Bytes	2024-7-6 15:15:15
AC	李禹衡 (liyuheng22006)	18ms	384 KiB		238 Bytes	2022-9-3 10:55:25
AC	王科睿 (鲨凋的小鲨鱼)	18ms	392 KiB		465 Bytes	2022-5-28 19:28:56
AC	希蒙 (zhengxingya)	18ms	6.8 MiB		281 Bytes	2023-10-18 17:39:23
AC	11451254188 (22029-mjh)	18ms	384 KiB		318 Bytes	2022-12-9 18:16:07
AC	11111	18ms	412 KiB		265 Bytes	2022-4-17 11:14:47
AC	huyinuo	18ms	436 KiB		301 Bytes	2022-3-19 13:39:26
AC	zhangyh (张育菡)	18ms	436 KiB		248 Bytes	2022-6-10 22:34:31
AC	章愉霖	18ms	392 KiB		325 Bytes	2023-4-16 17:47:36
AC	杜是贤 (dushixian)	18ms	444 KiB		237 Bytes	2022-5-22 11:32:12
AC	scallway	18ms	440 KiB		230 Bytes	2022-8-12 11:09:12
AC	秦子越 (13883322087)	18ms	512 KiB		297 Bytes	2022-6-12 9:13:47
AC	时代2校+施皓宬 (shihaocheng)	18ms	512 KiB		240 Bytes	2023-4-29 17:21:23
AC	魏楚浔 (shawn)	18ms	512 KiB		302 Bytes	2022-6-3 10:48:05
AC	邬文博 (wwb)	18ms	384 KiB		230 Bytes	2023-5-21 12:02:29
AC	郭人瑀作业号	18ms	440 KiB		234 Bytes	2022-8-2 15:02:27
AC	微风将至 (李睿轩)	18ms	384 KiB		239 Bytes	2022-5-20 21:14:01
AC	罗毅川 (scp-049)	18ms	384 KiB		261 Bytes	2022-6-3 20:08:19
AC	呵 (mohaoran)	18ms	392 KiB		229 Bytes	2022-10-2 18:51:09
AC	田世瑞	18ms	384 KiB		247 Bytes	2023-3-26 14:17:07
AC	chenyantong	18ms	456 KiB		222 Bytes	2023-3-3 20:37:07
AC	. (Pig)	18ms	412 KiB		285 Bytes	2022-1-18 11:48:45
AC	张梓浩 (zhangzihao)	18ms	428 KiB		286 Bytes	2023-5-24 20:17:39
AC	极为的好van的 (lyq)	18ms	392 KiB		223 Bytes	2022-7-28 10:10:55
AC	偽艺術家 (chenyanchi22006)	18ms	384 KiB		231 Bytes	2022-6-29 18:24:23
AC	luosifu22006	18ms	384 KiB		229 Bytes	2022-8-14 10:20:49
AC	JOKER (hhy)	18ms	7 MiB	C++98	508 Bytes	2024-6-10 9:48:46
AC	张月恒	18ms	7 MiB	C++98(O2)	243 Bytes	2024-6-26 16:37:09
AC	张梓辰	18ms	412 KiB		238 Bytes	2022-8-31 20:25:21
AC	徐子恩 (Cow)	18ms	436 KiB		280 Bytes	2022-1-21 17:13:21
AC	zhangheyi22006	18ms	384 KiB		234 Bytes	2022-8-13 16:53:39
AC	wuzhenghan	18ms	388 KiB		287 Bytes	2022-9-4 17:29:32
AC	sunxiao	18ms	384 KiB		267 Bytes	2022-10-28 21:18:08
AC	霍弈丞小号	18ms	384 KiB		250 Bytes	2023-1-31 11:19:25
AC	王泓涵 (whh)	18ms	384 KiB		279 Bytes	2022-7-2 11:45:34
AC	dustsans (njo)	18ms	420 KiB		230 Bytes	2022-9-9 20:40:13
AC	庹仕杰	18ms	384 KiB		254 Bytes	2023-5-13 15:19:59
AC	luosifu22006	18ms	436 KiB		256 Bytes	2022-8-18 16:59:54
AC	444444444 (唐跃元)	18ms	412 KiB		269 Bytes	2023-1-31 20:31:51
AC	江坤锜	18ms	384 KiB		273 Bytes	2023-4-8 20:23:44
AC	22016-oyc	18ms	384 KiB		262 Bytes	2022-9-18 9:45:15
AC	王祎辰 (wangyichen)	18ms	384 KiB		300 Bytes	2023-4-22 18:50:18
AC	chenyantong	18ms	432 KiB		222 Bytes	2023-3-3 20:37:12
AC	李旻轩	18ms	7.1 MiB		299 Bytes	2023-6-10 19:17:04
AC	ywh	18ms	452 KiB		199 Bytes	2022-7-8 10:26:41
AC	刘煜轩	18ms	392 KiB		239 Bytes	2023-5-13 17:28:34
AC	我是曾科智儿子 (沈小童)	18ms	384 KiB		293 Bytes	2023-5-13 15:01:36
AC	LUKHE (LukeHu)	18ms	384 KiB		251 Bytes	2022-1-25 20:55:08
AC	凌肯 (lingken22006)	18ms	384 KiB		292 Bytes	2022-9-15 17:58:42
AC	南坪校区-邵冠铖 (邵冠铖)	18ms	384 KiB		227 Bytes	2023-5-14 12:25:56
AC	ZERO_VOID	18ms	384 KiB		262 Bytes	2022-6-4 11:57:11