统计数字字符个数

状态	递交者	时间	内存	语言	代码	递交时间
AC	赵泳鑫 (zhaoyongxin)	3ms	256 KiB		261 Bytes	2022-4-16 19:51:05
AC	李山水	3ms	256 KiB		261 Bytes	2022-2-16 17:42:25
AC	李山水	3ms	256 KiB		261 Bytes	2022-2-16 17:42:27
AC	李山水	3ms	256 KiB		261 Bytes	2022-2-16 17:42:27
AC	李山水	3ms	308 KiB		261 Bytes	2022-2-16 17:42:11
AC	李山水	3ms	256 KiB		261 Bytes	2022-2-16 17:42:26
AC	李山水	3ms	256 KiB		261 Bytes	2022-2-16 17:42:18
AC	wangruibo20xh	4ms	304 KiB		260 Bytes	2022-2-12 18:57:06
AC	张瑞博	6ms	6.7 MiB	C++11	208 Bytes	2024-7-13 14:46:21
AC	MoonLight ( aaa)	6ms	384 KiB		379 Bytes	2022-1-25 12:37:58
AC	zyq1	6ms	512 KiB		259 Bytes	2023-4-3 20:55:28
AC	Randy Marsh (杨子腾)	6ms	384 KiB		262 Bytes	2022-6-12 18:42:43
AC	李树崑 (lishukun)	6ms	384 KiB		268 Bytes	2022-8-3 18:24:59
AC	Yangshenxin (𝒲𝒶𝓉𝑒𝓇)	6ms	384 KiB		282 Bytes	2022-1-23 18:45:45
AC	LUKHE (LukeHu)	6ms	440 KiB		327 Bytes	2022-4-16 16:50:52
AC	安闵煜 (anzai)	6ms	6.9 MiB	C++11	224 Bytes	2024-8-19 10:39:03
AC	Accepted (周芷乐)	6ms	6.7 MiB	C++14	260 Bytes	2024-7-20 12:34:29
AC	luoluonuoya	6ms	384 KiB		313 Bytes	2022-6-18 16:02:26
AC	ywh	6ms	444 KiB		205 Bytes	2022-6-25 13:50:39
AC	huyinuo	6ms	424 KiB		279 Bytes	2022-5-8 10:21:18
AC	杜是贤 (dushixian)	6ms	436 KiB		234 Bytes	2022-8-2 11:55:22
AC	Tang	7ms	384 KiB		234 Bytes	2022-2-13 10:46:58
AC	汪致卉 (wangzh)	7ms	384 KiB		264 Bytes	2022-1-29 0:35:07
AC	姚宏逸	7ms	420 KiB		244 Bytes	2022-2-4 12:08:07
AC	源著校区-宋昊成 (马冬梅)	7ms	440 KiB		274 Bytes	2023-2-26 19:47:04
AC	爱琴海校区-刁钲洋 (刁钲洋)	7ms	384 KiB		251 Bytes	2023-2-15 16:17:09
AC	中岛敦 (黄麒瑞)	7ms	6.8 MiB		289 Bytes	2023-10-21 8:00:39
AC	杜俊宏	7ms	384 KiB		199 Bytes	2022-6-5 9:16:32
AC	杨瀚霖 (yanghanlin)	7ms	424 KiB		274 Bytes	2023-2-18 11:10:54
AC	徐子恩 (Cow)	7ms	436 KiB		234 Bytes	2022-3-20 9:23:04
AC	陈雨泽1	7ms	6.9 MiB	C++98	507 Bytes	2024-6-3 16:40:52
AC	qinlang	7ms	6.8 MiB		342 Bytes	2023-10-19 20:36:10
AC	王晨志 (wangchenzhi)	7ms	432 KiB		361 Bytes	2022-7-1 14:39:33
AC	谢博文	7ms	384 KiB		234 Bytes	2022-2-13 10:49:17
AC	金沙校区-先珂熠 (九转大肠)	7ms	6.7 MiB	C++20(O2)	215 Bytes	2024-7-31 14:37:28
AC	1396013295	7ms	384 KiB		277 Bytes	2022-1-23 19:55:06
AC	LukeDid	7ms	440 KiB		323 Bytes	2023-4-22 13:32:21
AC	(张洛诚)	7ms	432 KiB		310 Bytes	2023-5-11 19:19:31
AC	许炜铭 (xuweiming)	7ms	7.4 MiB		239 Bytes	2023-6-10 20:28:46
AC	xyc (谢雨宸)	7ms	6.7 MiB		206 Bytes	2023-9-27 20:15:21
AC	原著校区巫映秋 (巫映秋1a)	7ms	7 MiB	C++98	220 Bytes	2024-6-28 22:56:44
AC	芒苒忧 (廖迦南)	7ms	444 KiB		271 Bytes	2022-8-3 15:18:01
AC	杜俊宏	7ms	436 KiB		199 Bytes	2022-6-5 9:16:31
AC	贾鑫豪 (Mr Sam)	7ms	444 KiB		241 Bytes	2022-3-3 21:46:20
AC	纪承熙 (jcx001)	7ms	7 MiB		223 Bytes	2023-7-11 11:47:37
AC	RanHao	7ms	6.9 MiB		273 Bytes	2023-8-18 17:35:47
AC	樊竣熠 (lft1114)	7ms	428 KiB		225 Bytes	2022-2-23 21:38:00
AC	坤坤荔枝小黑子 (zhonghaotian22006)	7ms	436 KiB		214 Bytes	2022-8-29 16:50:03
AC	经常消失 (小萝卜)	7ms	440 KiB		323 Bytes	2022-3-13 18:16:48
AC	阮 (媚狐不吃道旁李)	7ms	7.2 MiB	C++98	258 Bytes	2024-5-2 16:30:31
AC	朱泽晟	7ms	440 KiB		274 Bytes	2022-3-8 21:34:59
AC	不怎么聪明的家伙 (贺俊楠)	7ms	512 KiB		273 Bytes	2023-5-21 14:23:32
AC	ddz	7ms	384 KiB		245 Bytes	2022-3-20 17:58:13
AC	疯神芭芭脱丝 (李卓修)	7ms	512 KiB		246 Bytes	2022-7-11 14:10:01
AC	zhanghaoran	7ms	420 KiB		234 Bytes	2022-3-12 10:27:26
AC	王晴萱	7ms	7 MiB		239 Bytes	2023-7-16 11:43:59
AC	周琪渃	7ms	384 KiB		289 Bytes	2022-11-28 14:45:32
AC	冒牌陈杰晟【MOD】 (wed)	7ms	436 KiB		264 Bytes	2022-3-6 15:40:16
AC	时代1校-杨宇轩 (杨宇轩)	7ms	8.2 MiB		191 Bytes	2023-8-22 12:06:42
AC	你猜呀	8ms	440 KiB		192 Bytes	2023-3-23 20:17:43
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)	8ms	6.5 MiB		211 Bytes	2023-6-3 20:17:03
AC	时代一校蒋帛希 (13983392730)	8ms	512 KiB		204 Bytes	2023-3-19 18:20:25
AC	吴佳智 (AWM)	8ms	6.7 MiB		286 Bytes	2023-6-7 21:25:11
AC	胡澜之 (666hlz666)	8ms	6.7 MiB		286 Bytes	2023-6-7 21:27:31
AC	zlx (xiao)	8ms	428 KiB		273 Bytes	2022-11-27 12:12:19
AC	欧俊阳	8ms	6.7 MiB		235 Bytes	2023-8-21 14:00:12
AC	朱老师 (zyp)	8ms	384 KiB		238 Bytes	2022-10-28 16:16:36
AC	胡程禹	9ms	6.9 MiB		251 Bytes	2023-7-7 10:27:43
AC	colin1112 (墙凌可)	10ms	6.7 MiB		219 Bytes	2023-7-21 13:47:58
AC	没有此人 (akm)	12ms	7.2 MiB		233 Bytes	2023-12-30 15:05:20
AC	新壹街朱启航 (zhuqihang)	12ms	7 MiB		250 Bytes	2023-12-17 18:50:20
AC	小忙果 (王昱杰)	15ms	7 MiB		220 Bytes	2023-12-16 16:45:33
AC	褚博艺	37ms	532 KiB		229 Bytes	2024-3-30 16:35:39
AC	11111	93ms	4 MiB	Python 3	98 Bytes	2022-6-12 10:43:58
AC	爱琴海校区-刁钲洋 (刁钲洋)	94ms	4 MiB	Python 3	151 Bytes	2022-4-10 10:18:31
AC	杨坤霖 (steven)	94ms	4 MiB	Python 3	114 Bytes	2022-8-18 16:35:58
AC	梨冻亿 (wiueh)	100ms	3.9 MiB	Python 3	142 Bytes	2022-1-23 23:03:33