数1的个数

状态	递交者	时间	内存	语言	代码	递交时间
AC	经常消失 (小萝卜)	34ms	448 KiB		257 Bytes	2022-7-15 17:06:15
AC	付博plus	35ms	404 KiB		215 Bytes	2023-4-8 14:10:50
AC	lch (凌昌瀚)	35ms	436 KiB		208 Bytes	2022-8-1 13:47:28
AC	史继来	35ms	7 MiB	C++98	500 Bytes	2024-8-25 9:07:47
AC	徐绅博	35ms	7 MiB	C++98	226 Bytes	2024-6-14 20:15:39
AC	刘锦航	35ms	392 KiB		248 Bytes	2022-1-22 19:41:55
AC	魑归sama	35ms	432 KiB		208 Bytes	2022-7-12 16:27:31
AC	SYC0226	35ms	392 KiB		240 Bytes	2022-3-20 13:20:06
AC	黄梓桐 (HuangZiTong)	35ms	512 KiB		270 Bytes	2022-8-3 16:33:50
AC	kcs007	35ms	412 KiB		220 Bytes	2023-4-8 14:06:41
AC	yanglang	35ms	512 KiB		253 Bytes	2023-2-12 8:13:42
AC	源著校区-宋昊成 (马冬梅)	35ms	424 KiB		340 Bytes	2023-2-25 18:27:51
AC	疯神芭芭脱丝 (李卓修)	35ms	512 KiB		209 Bytes	2023-2-4 9:57:27
AC	老六在此	35ms	7 MiB	C++20	254 Bytes	2024-8-23 17:43:19
AC	赵泳鑫 (zhaoyongxin)	35ms	508 KiB		241 Bytes	2022-7-14 11:22:57
AC	yyds (杨骐嘉)	35ms	7.2 MiB	C++98	240 Bytes	2024-4-26 18:33:32
AC	heyi	35ms	6.8 MiB	C++98(O2)	258 Bytes	2024-8-10 15:30:40
AC	赵鑫宸 (xiaoxiao721)	35ms	448 KiB		218 Bytes	2022-2-26 18:40:00
AC	李彭宋代诗人 (ljy123456)	35ms	512 KiB		230 Bytes	2023-4-12 21:32:24
AC	yuzk	35ms	6.8 MiB	C++11	765 Bytes	2024-8-25 15:14:18
AC	谭懿轩 (yanyixuan)	35ms	440 KiB		216 Bytes	2022-2-23 22:04:09
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	35ms	512 KiB		264 Bytes	2022-9-24 23:06:44
AC	新壹街校区-陈品烨 (陈品烨)	35ms	6.8 MiB		209 Bytes	2023-10-2 14:49:42
AC	黄梓轩 (huangzixuan)	36ms	384 KiB		213 Bytes	2022-9-24 15:40:40
AC	CK (李弘毅)	36ms	384 KiB		211 Bytes	2022-9-24 15:39:33
AC	周琪渃	36ms	420 KiB		353 Bytes	2022-11-13 14:09:04
AC	zhanglianjie	36ms	384 KiB		242 Bytes	2023-4-1 17:21:00
AC	hnd (陈皓洋)	36ms	404 KiB		269 Bytes	2023-4-8 14:04:05
AC	不怎么聪明的家伙 (贺俊楠)	36ms	512 KiB		221 Bytes	2023-3-5 18:13:55
AC	呵呵呵 (陈思琦)	36ms	384 KiB		213 Bytes	2022-9-24 15:40:44
AC	朱老师 (zyp)	36ms	392 KiB		263 Bytes	2022-8-7 10:24:46
AC	王重道	36ms	440 KiB		276 Bytes	2022-4-16 15:32:06
AC	hyh22031	36ms	384 KiB		311 Bytes	2022-11-27 12:27:12
AC	冒牌陈杰晟【MOD】 (wed)	36ms	512 KiB		264 Bytes	2022-3-6 15:13:30
AC	Tender. (05c05-zhou)	36ms	512 KiB		391 Bytes	2023-2-17 20:11:09
AC	quzhibo	36ms	436 KiB		858 Bytes	2022-9-24 17:03:55
AC	新壹街.曾祥睿 (zxr)	36ms	6.7 MiB		255 Bytes	2023-9-14 21:02:14
AC	罗兰（漆黑襟默) (zhangxiaoci)	36ms	384 KiB		210 Bytes	2023-4-8 14:08:29
AC	新壹街校区--税崇峻 (税崇峻)	36ms	8 MiB		202 Bytes	2023-8-22 18:23:15
AC	金沙校区-蓝祥与 (蓝祥与)	36ms	384 KiB		225 Bytes	2023-4-8 14:10:08
AC	root1	36ms	512 KiB		233 Bytes	2022-7-23 16:55:52
AC	dyp (hhy)	36ms	6.9 MiB		307 Bytes	2023-8-26 11:23:54
AC	root1	36ms	436 KiB		216 Bytes	2022-7-23 14:38:55
AC	陈杰晟	36ms	512 KiB		257 Bytes	2022-2-20 11:27:28
AC	laiyouming22031	36ms	432 KiB		195 Bytes	2022-11-20 13:10:54
AC	王乐仪	36ms	512 KiB		219 Bytes	2022-2-19 17:01:01
AC	小忙果 (王昱杰)	36ms	6.9 MiB		232 Bytes	2023-7-18 8:49:42
AC	文硕 (文硕1)	36ms	512 KiB		236 Bytes	2023-2-1 8:42:11
AC	雷霆万钧 (袁崇栖)	36ms	6.7 MiB		230 Bytes	2023-9-16 10:20:19
AC	叶雨昊 (yeyuhao22006)	36ms	432 KiB		207 Bytes	2022-10-23 20:12:03
AC	wangyueru	36ms	388 KiB		226 Bytes	2022-11-12 20:38:13
AC	luoluonuoya	36ms	512 KiB		230 Bytes	2022-8-13 15:11:00
AC	中岛敦 (黄麒瑞)	36ms	6.7 MiB		221 Bytes	2023-9-30 21:24:37
AC	叶梓珺	36ms	6.8 MiB		225 Bytes	2023-11-5 11:53:10
AC	伍行念 (wuxingnian)	37ms	6.8 MiB		292 Bytes	2023-10-7 16:14:42
AC	1 (高梓睿23025)	37ms	7 MiB	C++98	243 Bytes	2024-6-26 14:58:58
AC	pandap&a王皓宸 (WANGHAOCHEN)	37ms	432 KiB		390 Bytes	2023-2-24 17:31:03
AC	许嘉恩 (xje22031)	37ms	512 KiB		240 Bytes	2022-11-26 21:20:45
AC	黄立信	37ms	6.8 MiB		385 Bytes	2023-10-17 20:03:33
AC	zcx	37ms	512 KiB		299 Bytes	2023-2-11 12:25:28
AC	cjc23025	37ms	7 MiB	C++98(O2)	265 Bytes	2024-6-26 15:01:55
AC	Jack	37ms	448 KiB		239 Bytes	2023-3-23 19:32:36
AC	Nico	37ms	492 KiB		279 Bytes	2023-4-30 15:08:22
AC	繁星 (05c35-zzm)	37ms	440 KiB		272 Bytes	2022-12-1 12:30:51
AC	dustsans (njo)	37ms	512 KiB		225 Bytes	2023-5-10 18:35:38
AC	六 (江智昕)	37ms	432 KiB		229 Bytes	2023-2-25 12:04:32
AC	(张洛诚)	37ms	6.9 MiB		332 Bytes	2023-6-29 9:00:25
AC	陈海骞 (chq)	37ms	512 KiB		280 Bytes	2023-5-11 18:46:39
AC	lichenrui23010	38ms	6.7 MiB		183 Bytes	2023-8-25 10:56:59
AC	邵冠铖 (shaoguancheng22031)	38ms	384 KiB		216 Bytes	2022-11-27 12:10:14
AC	胡程禹	38ms	6.7 MiB		297 Bytes	2023-9-13 20:42:44
AC	huanglu	38ms	6.9 MiB		235 Bytes	2023-7-18 11:09:28
AC	RanHao	38ms	7 MiB		263 Bytes	2023-7-18 15:56:12
AC	scallway	38ms	512 KiB		219 Bytes	2022-9-24 15:34:40
AC	极为的好van的 (lyq)	38ms	444 KiB		191 Bytes	2022-7-28 9:38:47
AC	邹曜丞 (13983097018)	38ms	436 KiB		206 Bytes	2023-5-6 20:27:41
AC	漆星语 (qixingyu)	38ms	424 KiB		304 Bytes	2023-3-11 11:33:47
AC	坤坤荔枝小黑子 (zhonghaotian22006)	38ms	440 KiB		374 Bytes	2022-11-28 9:24:06
AC	牟淳雅	38ms	6.8 MiB		262 Bytes	2023-9-24 12:14:46
AC	金锦泽 (jinjinze)	38ms	392 KiB		226 Bytes	2023-5-11 18:55:24
AC	刘蕤箎	39ms	7 MiB		237 Bytes	2023-8-26 11:15:22
AC	zyl	39ms	7.3 MiB		210 Bytes	2024-1-4 10:52:51
AC	wuqi	39ms	6.9 MiB		266 Bytes	2023-8-5 17:00:18
AC	爱琴海校区jzn (jzn)	39ms	6.8 MiB		285 Bytes	2023-7-3 21:21:04
AC	我很6 (zjj22031)	39ms	384 KiB		223 Bytes	2022-12-1 13:31:44
AC	(金沙天街)严皓月 (严皓月)	39ms	7.1 MiB		233 Bytes	2023-11-25 11:07:32
AC	向俊熙 (xiangjunxi23003)	39ms	388 KiB		214 Bytes	2023-4-1 17:12:34
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)	39ms	432 KiB		270 Bytes	2023-2-11 11:08:17
AC	叶哲宇 (yzy)	39ms	512 KiB		216 Bytes	2023-5-28 12:25:14
AC	新壹街陈科言 (cky)	39ms	7.3 MiB		363 Bytes	2023-7-20 14:38:18
AC	郑岐蔚	39ms	436 KiB		215 Bytes	2022-11-6 18:42:10
AC	时代1校-杨宇轩 (杨宇轩)	40ms	6.9 MiB		221 Bytes	2023-8-21 14:11:52
AC	胡澜之 (666hlz666)	40ms	512 KiB		316 Bytes	2023-4-26 20:30:18
AC	Microsoft (hu_moren)	40ms	6.9 MiB		314 Bytes	2023-7-29 14:12:16
AC	刘致言	40ms	512 KiB		222 Bytes	2023-3-11 9:34:01
AC	colin1112 (墙凌可)	40ms	436 KiB		291 Bytes	2023-3-18 15:01:25
AC	爱情海校区—沙天一 (沙天一)	40ms	7.1 MiB		255 Bytes	2023-7-9 9:21:17
AC	yiqiuyu	40ms	512 KiB		273 Bytes	2023-4-8 19:45:46
AC	ganlin1	40ms	6.7 MiB		211 Bytes	2023-6-7 14:30:57
AC	zhm123	40ms	512 KiB		218 Bytes	2023-5-11 19:02:54