判断正整数位数

状态	递交者	时间	内存	语言	代码	递交时间
AC	qwerty	5ms	8.4 MiB	C	203 Bytes	2022-2-15 22:14:02
AC	姚宏逸	5ms	8.4 MiB	C	187 Bytes	2022-1-30 21:49:48
AC	时代二校-陈天成 (鸭缩毛巾)	6ms	7.1 MiB		101 Bytes	2024-1-22 11:05:17
AC	stehpen_zuo	8ms	6.8 MiB	C++20	231 Bytes	2024-5-23 12:22:16
AC	Noah (mwx)	8ms	7.2 MiB	C++98	1.5 KiB	2024-5-6 19:09:57
AC	Erin	8ms	7.2 MiB	C++98	157 Bytes	2024-5-2 15:44:37
AC	杨淇瑞 (杨淇瑞29)	8ms	6.8 MiB		256 Bytes	2023-10-16 21:21:00
AC	崔欧辰	8ms	6.7 MiB	C++11	199 Bytes	2024-7-22 16:39:05
AC	heyuzhe	8ms	6.8 MiB	C++98	210 Bytes	2024-8-15 17:57:52
AC	星野光 (Hoshino Hikari)	8ms	7.5 MiB		380 Bytes	2023-10-22 17:16:04
AC	Accepted (周芷乐)	8ms	7 MiB	C++14	192 Bytes	2024-6-17 21:35:24
AC	新壹街校区--税崇峻 (税崇峻)	8ms	6.9 MiB		161 Bytes	2023-8-16 17:45:56
AC	刘思齐	8ms	7 MiB	C++98	356 Bytes	2024-6-28 17:04:36
AC	Him (李俊熙)	8ms	7.2 MiB		259 Bytes	2023-12-31 16:06:59
AC	zvt_132 (任子轩)	8ms	6.5 MiB	C++98	205 Bytes	2024-7-26 11:58:27
AC	Him神	8ms	6.8 MiB		310 Bytes	2023-10-6 12:48:07
AC	牟淳雅	8ms	7 MiB		174 Bytes	2023-9-24 10:45:20
AC	真的高兴(死)了 (huyunyi1)	8ms	7 MiB	C++11	134 Bytes	2024-5-27 20:51:55
AC	郑尧 (zhengyao)	8ms	6.9 MiB	C++98	213 Bytes	2024-6-15 21:27:24
AC	张瑞博	8ms	7 MiB	C++11	184 Bytes	2024-5-17 21:14:54
AC	zzl	8ms	6.8 MiB		113 Bytes	2023-11-7 0:17:08
AC	jighghjkfkhfdhdfdfdsfsdfsafvmnkbnkbmnlvnmkbvnvb;,.m;,;.;,;kbvlmkbnlmkblnvkmlbnkmlbvkmlbvklmbkmlkblmbnm;,l.,.;,'.,';.[',;.[,kjkoihgfhfgiohifgohifgohiofgihgofhiofgihofgihofgihofgiho;''[;.',m;.',m.;',.;'m,.;';'cv;x'cb'cx;b'cv;b'xc;b'c;b'cvbvc.'bv.//,/vb./vcb./cvbv,c.b,cv.,b.cv,b.vc,bg;hgl;hgl;hg;h;hfg;hl;lf;l;lxc;cln;bvln;vcln;vnl;vbl;vbln;vlv;blnvb;plnp;lplhfljpjh;nlvb;nv;bn;vcvl;nlv;nlv;g;hjhchl;ghfghl;fghl;ltlh;l;hlf;lg;bnlc;;nlv;nbv;nbv;nvb;nlvcnl;xc;blxcb;ll;hg;lhgl;dfl;t;ldy;l;lyl;rewlt493;l;dl;dsflg;lsdlpbpcxobpocvbpopopopreopotpreotertertretert (litingxu)	8ms	6.9 MiB		180 Bytes	2023-8-15 15:57:48
AC	宋坤霖	8ms	7.1 MiB	C++11	181 Bytes	2024-4-20 13:28:27
AC	杨颂恩 (yangsongen)	8ms	6.9 MiB	C++11(O2)	168 Bytes	2024-8-22 21:46:55
AC	heyi	8ms	6.8 MiB	C++98(O2)	229 Bytes	2024-8-8 14:45:01
AC	一片落叶 (yeyuhao)	8ms	6.7 MiB		106 Bytes	2023-8-28 20:19:24
AC	向俊熙 (xiangjunxi23003)	8ms	6.8 MiB		204 Bytes	2023-10-25 17:25:06
AC	amr (董子溪)	8ms	7.3 MiB		309 Bytes	2023-12-31 15:36:11
AC	罗伟杰 (13308275065)	9ms	8.4 MiB		237 Bytes	2022-11-30 21:52:26
AC	希蒙 (zhengxingya)	9ms	6.9 MiB		106 Bytes	2023-8-20 17:23:37
AC	JOKER (hhy)	9ms	8.3 MiB		303 Bytes	2023-5-7 10:17:42
AC	贾博涵	9ms	6.8 MiB		168 Bytes	2023-11-7 14:43:10
AC	李龙腾 (llt)	9ms	8.3 MiB		178 Bytes	2023-6-29 20:47:47
AC	火爆肥肠（杨弘毅） (火爆肥肠)	9ms	8.4 MiB		356 Bytes	2022-3-4 22:30:17
AC	源著校区-宋昊成 (马冬梅)	9ms	8.4 MiB		294 Bytes	2023-2-25 18:02:17
AC	蒲梓勋 (puzixun)	9ms	8.4 MiB		231 Bytes	2022-10-2 10:18:47
AC	曹埊睿 (caodirui)	9ms	8.4 MiB		191 Bytes	2023-4-15 13:29:43
AC	疯神芭芭脱丝 (李卓修)	9ms	8.4 MiB		333 Bytes	2022-1-23 11:50:41
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	9ms	8.4 MiB		192 Bytes	2022-8-9 21:10:03
AC	暗蛆突围 (lzh)	9ms	7 MiB		206 Bytes	2023-12-28 18:21:25
AC	yxj	9ms	8.4 MiB		193 Bytes	2022-10-20 15:44:55
AC	pandap&a王皓宸 (WANGHAOCHEN)	9ms	8.4 MiB		193 Bytes	2022-12-9 19:44:39
AC	GYZ	9ms	8.4 MiB		219 Bytes	2022-5-15 20:18:35
AC	王玺懿 (wxy)	9ms	8.4 MiB		235 Bytes	2022-7-31 11:31:13
AC	huyinuo	9ms	8.4 MiB		252 Bytes	2022-5-7 22:55:29
AC	hzm	9ms	8.4 MiB		189 Bytes	2022-10-29 22:35:16
AC	🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕 (bro)	9ms	8.4 MiB		282 Bytes	2022-1-25 13:05:37
AC	任童(rentong)	9ms	8.4 MiB		185 Bytes	2022-6-11 15:03:33
AC	luoluonuoya	9ms	8.4 MiB		303 Bytes	2022-2-19 16:08:19
AC	谭懿轩 (yanyixuan)	9ms	8.4 MiB		177 Bytes	2022-2-15 13:47:29
AC	关博源	9ms	8.4 MiB		122 Bytes	2023-3-2 18:26:59
AC	56 (13883454928)	9ms	8.3 MiB		191 Bytes	2023-6-7 18:19:35
AC	(张洛诚)	9ms	8.3 MiB		355 Bytes	2023-4-20 20:37:09
AC	Nico	9ms	8.4 MiB		241 Bytes	2023-3-28 17:23:17
AC	zlx (xiao)	9ms	8.4 MiB		157 Bytes	2022-5-24 21:55:44
AC	吴俊成 (wujuncheng)	9ms	8.4 MiB		402 Bytes	2022-7-9 22:13:41
AC	SMIK	9ms	8.4 MiB		406 Bytes	2022-1-24 12:42:39
AC	何洋名 (heyangming)	9ms	8.4 MiB		184 Bytes	2022-10-6 14:04:33
AC	张雯皓 (zhangwenhao)	9ms	8.3 MiB		333 Bytes	2023-7-15 8:40:42
AC	yanglang	9ms	8.4 MiB		115 Bytes	2022-10-21 23:00:56
AC	黄立信	9ms	6.9 MiB		114 Bytes	2023-8-18 15:15:14
AC	xxteacher	9ms	8.4 MiB		353 Bytes	2022-1-28 13:36:04
AC	时代一校蒋帛希 (13983392730)	9ms	8.3 MiB		128 Bytes	2023-5-29 20:40:57
AC	hnd (陈皓洋)	9ms	8.4 MiB		215 Bytes	2022-8-25 13:46:38
AC	huanglu	9ms	8.3 MiB		199 Bytes	2023-7-15 15:02:12
AC	新壹街校区-杨轩懿 (杨轩懿1)	9ms	8.3 MiB		246 Bytes	2023-7-26 18:05:19
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)	9ms	8.3 MiB		125 Bytes	2023-5-15 18:51:07
AC	时代一校-曾科智 (曾科智)	9ms	8.4 MiB		205 Bytes	2023-2-25 19:35:40
AC	谢博文	9ms	8.4 MiB		293 Bytes	2022-2-19 11:04:56
AC	无尽的想象 (谭仕高)	9ms	8.4 MiB		172 Bytes	2022-7-14 11:44:38
AC	新壹街-王俊博 (王俊博)	9ms	7 MiB	C++98	135 Bytes	2024-6-8 14:46:38
AC	tad (OP AI)	9ms	7 MiB	C++98	251 Bytes	2024-6-17 20:43:58
AC	胡宸华 (huchenhua)	9ms	8.4 MiB		196 Bytes	2022-10-26 13:54:42
AC	洛阳锦程 (郭思利)	9ms	7.3 MiB	C++98	251 Bytes	2024-5-19 9:38:13
AC	罗莎莎	9ms	8.3 MiB		168 Bytes	2023-7-20 15:15:40
AC	张祖名	9ms	6.7 MiB		207 Bytes	2023-9-5 19:38:45
AC	偽艺術家 (chenyanchi22006)	9ms	8.4 MiB		182 Bytes	2022-8-20 15:33:32
AC	彭嘉豪 (pengjiahao)	9ms	8.4 MiB		215 Bytes	2023-1-26 11:20:48
AC	叶哲宇 (yzy)	9ms	8.3 MiB		180 Bytes	2023-6-23 10:34:39
AC	凌肯 (lingken22006)	9ms	8.4 MiB		298 Bytes	2022-7-31 18:57:15
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	9ms	8.3 MiB		247 Bytes	2023-5-10 22:00:49
AC	时代2校-程俊燃 (chengjunran)	9ms	8.3 MiB		190 Bytes	2023-4-19 19:42:44
AC	Error404sans (焦阳浩云)	9ms	8.4 MiB		299 Bytes	2023-1-16 14:00:56
AC	德意志第三帝国 (陈远桥)	9ms	8.4 MiB		304 Bytes	2022-7-14 15:04:21
AC	Mr_D	10ms	8.3 MiB		262 Bytes	2023-6-22 12:50:19
AC	繁星 (05c35-zzm)	10ms	8.4 MiB		121 Bytes	2022-11-13 8:57:47
AC	罗晨睿 (luochenrui)	10ms	8.4 MiB		173 Bytes	2022-6-26 16:18:07
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	10ms	8.4 MiB		276 Bytes	2022-7-7 11:10:35
AC	maomao	10ms	8.4 MiB		120 Bytes	2022-5-22 22:59:27
AC	李哲 (lizhe)	10ms	8.4 MiB		336 Bytes	2022-11-11 18:00:13
AC	芒苒忧 (廖迦南)	10ms	8.4 MiB		306 Bytes	2022-1-25 15:20:44
AC	Randy Marsh (杨子腾)	10ms	8.4 MiB		125 Bytes	2022-5-8 11:40:51
AC	任瑞的学生 (jiangyadong)	10ms	8.4 MiB		220 Bytes	2022-6-14 17:12:11
AC	赵泳鑫 (zhaoyongxin)	10ms	8.4 MiB		236 Bytes	2022-4-23 17:41:11
AC	chaikexu	10ms	8.4 MiB		177 Bytes	2022-11-13 12:24:23
AC	章愉霖	10ms	8.3 MiB		114 Bytes	2023-6-12 19:16:15
AC	灿灿 (CAN)	10ms	8.4 MiB		165 Bytes	2022-6-22 16:23:59
AC	xflt_dyp	10ms	8.4 MiB		161 Bytes	2023-8-11 10:59:58
AC	xuniaoyin (徐袅音)	10ms	8.3 MiB		327 Bytes	2023-8-5 10:49:52
AC	朱老师 (zyp)	10ms	8.4 MiB		225 Bytes	2022-7-28 10:52:39