5位的密码判断

状态	递交者	时间	内存	语言	代码	递交时间
AC	cola	-	6.9 MiB		311 Bytes	2023-11-23 15:02:54
AC	zyl	4ms	7.3 MiB		258 Bytes	2024-1-3 17:03:52
AC	况奕辛 (KYX_yyds)	4ms	384 KiB		305 Bytes	2022-1-2 19:50:34
AC	草\|\|草 (陈星佑)	5ms	384 KiB		393 Bytes	2022-8-18 16:56:33
AC	yang	5ms	384 KiB		375 Bytes	2022-8-14 18:03:31
AC	11111	5ms	392 KiB		301 Bytes	2022-8-2 18:40:46
AC	吴俊成 (wujuncheng)	5ms	420 KiB		368 Bytes	2022-7-9 10:07:02
AC	无尽的想象 (谭仕高)	5ms	384 KiB		435 Bytes	2022-7-13 23:48:15
AC	LukeDid	5ms	512 KiB		399 Bytes	2023-4-22 18:52:52
AC	张祖名	5ms	6.8 MiB	C++98(O2)	280 Bytes	2024-6-5 22:45:48
AC	NJL (NJlL)	5ms	384 KiB		403 Bytes	2022-4-10 18:06:00
AC	zhangyh (张育菡)	5ms	384 KiB		290 Bytes	2022-6-11 11:08:45
AC	爱琴海校区-刁钲洋 (刁钲洋)	5ms	440 KiB		371 Bytes	2023-2-8 19:09:23
AC	蒲梓勋 (puzixun)	5ms	384 KiB		359 Bytes	2022-7-14 20:08:48
AC	冒牌陈杰晟【MOD】 (wed)	5ms	384 KiB		259 Bytes	2022-3-20 13:08:37
AC	王韵淮	5ms	512 KiB		347 Bytes	2022-5-20 21:23:12
AC	梨冻亿 (wiueh)	5ms	384 KiB		409 Bytes	2022-1-27 13:29:47
AC	马渝杭 (mayuhang)	5ms	384 KiB		525 Bytes	2023-4-8 21:36:32
AC	曹埊睿 (caodirui)	5ms	384 KiB		396 Bytes	2023-4-13 21:44:02
AC	王玺懿 (wxy)	5ms	384 KiB		278 Bytes	2022-8-14 17:47:13
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	5ms	6.6 MiB	C++98	471 Bytes	2024-7-28 15:18:34
AC	luoluonuoya	5ms	384 KiB		304 Bytes	2022-8-15 13:38:29
AC	qinyi	5ms	384 KiB		399 Bytes	2022-3-5 18:39:36
AC	疯神芭芭脱丝 (李卓修)	5ms	384 KiB		297 Bytes	2022-7-14 9:12:01
AC	甄一阳 (22016-zyy)	5ms	384 KiB		388 Bytes	2023-5-11 20:14:40
AC	任瑞的学生 (jiangyadong)	5ms	384 KiB		334 Bytes	2022-6-21 13:43:31
AC	叶哲宇 (yzy)	5ms	8 MiB		350 Bytes	2023-8-22 16:39:41
AC	草\|\|草 (陈星佑)	5ms	384 KiB		393 Bytes	2022-8-18 16:56:05
AC	xxteacher	5ms	384 KiB		698 Bytes	2022-3-29 14:15:11
AC	无尽的想象 (谭仕高)	5ms	6.8 MiB	C++11	344 Bytes	2024-6-24 20:27:03
AC	王祎辰 (wangyichen)	5ms	6.9 MiB	C++11	281 Bytes	2024-6-13 17:39:22
AC	草\|\|草 (陈星佑)	5ms	384 KiB		393 Bytes	2022-8-18 16:56:04
AC	朱老师 (zyp)	5ms	392 KiB		307 Bytes	2022-7-28 10:32:07
AC	赵泳鑫 (zhaoyongxin)	5ms	428 KiB		313 Bytes	2022-7-17 9:52:18
AC	时代2校-程俊燃 (chengjunran)	5ms	6.9 MiB		388 Bytes	2023-8-20 22:14:30
AC	Z.饮月君 (张皓南)	5ms	384 KiB		388 Bytes	2022-5-20 16:28:01
AC	maomao	5ms	444 KiB		295 Bytes	2022-5-22 22:42:23
AC	张瑞博	5ms	6.6 MiB	C++11	477 Bytes	2024-7-25 16:07:12
AC	dengfeng	5ms	384 KiB		352 Bytes	2022-3-17 21:04:57
AC	超级管理员 (root)	5ms	392 KiB		264 Bytes	2022-2-18 14:00:02
AC	huanglu	5ms	7 MiB		340 Bytes	2023-7-15 14:50:50
AC	经常消失 (小萝卜)	5ms	384 KiB		399 Bytes	2022-3-31 21:34:09
AC	无尽的想象 (谭仕高)	5ms	384 KiB		362 Bytes	2022-7-13 23:42:16
AC	zzl	5ms	6.8 MiB		313 Bytes	2023-11-7 0:13:34
AC	草\|\|草 (陈星佑)	5ms	384 KiB		393 Bytes	2022-8-18 16:56:05
AC	Erin	5ms	7.2 MiB	C++98	386 Bytes	2024-5-2 11:11:33
AC	吕同学是傻逼 (黄立信)	5ms	6.8 MiB		411 Bytes	2023-10-11 21:16:35
AC	xxteacher	5ms	412 KiB		699 Bytes	2022-3-29 14:14:59
AC	dengfeng	5ms	384 KiB		337 Bytes	2022-3-17 21:06:09
AC	洛阳锦程 (郭思利)	5ms	7.3 MiB	C++98	267 Bytes	2024-5-19 9:24:06
AC	ycy	5ms	384 KiB		258 Bytes	2022-9-6 17:29:25
AC	一片落叶 (yeyuhao)	5ms	6.7 MiB		329 Bytes	2023-8-28 20:17:47
AC	贾博涵	5ms	6.8 MiB		536 Bytes	2023-11-7 14:24:18
AC	^_^ (ctc)	5ms	6.8 MiB		330 Bytes	2023-10-18 20:26:32
AC	星野光 (Hoshino Hikari)	5ms	6.8 MiB		370 Bytes	2023-10-21 19:29:11
AC	朱老师 (zyp)	5ms	384 KiB		272 Bytes	2023-4-19 19:45:56
AC	SYC0226	5ms	432 KiB		429 Bytes	2022-3-13 13:20:20
AC	草\|\|草 (陈星佑)	5ms	384 KiB		393 Bytes	2022-8-17 17:36:06
AC	中岛敦 (黄麒瑞)	5ms	6.7 MiB		402 Bytes	2023-9-30 21:26:29
AC	chen (peter)	5ms	428 KiB		515 Bytes	2023-2-18 3:21:44
AC	郑尧 (zhengyao)	5ms	7 MiB	C++98	272 Bytes	2024-6-15 21:25:48
AC	zzzrrrxxx	5ms	7 MiB	C++98	336 Bytes	2024-6-16 14:51:19
AC	stehpen_zuo	5ms	6.9 MiB	C++20	442 Bytes	2024-5-20 13:41:14
AC	陈杰晟	5ms	384 KiB		257 Bytes	2022-2-20 9:40:51
AC	zhm123	5ms	6.9 MiB		309 Bytes	2023-7-25 17:19:13
AC	谭懿轩 (yanyixuan)	5ms	440 KiB		377 Bytes	2022-2-15 13:35:08
AC	1396013295	5ms	388 KiB		485 Bytes	2022-1-23 20:05:43
AC	崔欧辰	5ms	6.8 MiB	C++11	401 Bytes	2024-8-7 11:57:06
AC	杨浩灵 (金坷拉)	6ms	448 KiB		393 Bytes	2023-1-4 23:06:33
AC	heyi	6ms	6.8 MiB	C++98(O2)	277 Bytes	2024-8-8 14:38:34
AC	贾博涵	6ms	6.8 MiB		521 Bytes	2023-11-7 14:25:01
AC	yanglang	6ms	392 KiB		314 Bytes	2022-10-21 16:45:14
AC	CK (李弘毅)	6ms	7.1 MiB		402 Bytes	2023-10-21 19:40:02
AC	penghy	6ms	6.9 MiB		545 Bytes	2023-7-27 17:01:16
AC	Nico	6ms	428 KiB		322 Bytes	2023-3-28 17:18:26
AC	草\|\|草 (陈星佑)	6ms	444 KiB		393 Bytes	2022-8-18 16:47:50
AC	zhangzhimo	6ms	440 KiB		393 Bytes	2022-12-3 17:08:16
AC	德克萨斯做的到吗 (liyangbao)	6ms	384 KiB		297 Bytes	2022-11-7 16:40:07
AC	草\|\|草 (陈星佑)	6ms	440 KiB		393 Bytes	2022-8-18 16:54:16
AC	王胤钦 (wangyinqin)	6ms	7 MiB		393 Bytes	2023-7-9 9:17:07
AC	坤坤荔枝小黑子 (zhonghaotian22006)	6ms	392 KiB		371 Bytes	2022-10-16 16:32:33
AC	wangzihang	6ms	392 KiB		406 Bytes	2023-4-1 17:49:47
AC	章愉霖	6ms	6.8 MiB		285 Bytes	2023-6-13 21:55:31
AC	Tender. (05c05-zhou)	6ms	440 KiB		423 Bytes	2022-9-25 14:24:10
AC	pandap&a王皓宸 (WANGHAOCHEN)	6ms	452 KiB		588 Bytes	2023-3-3 21:02:23
AC	Iodef (OP AI)	6ms	6.7 MiB	C++11	299 Bytes	2024-8-2 10:26:12
AC	李廷旭 (litingxu)	6ms	6.9 MiB		372 Bytes	2023-8-17 15:24:32
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)	6ms	436 KiB		259 Bytes	2023-5-15 18:43:38
AC	赵沛喆	6ms	6.8 MiB		268 Bytes	2023-11-1 19:38:03
AC	时代二校-焦雨齐 (Angel)	6ms	6.9 MiB		255 Bytes	2023-6-30 18:10:35
AC	yxj	6ms	436 KiB		459 Bytes	2022-10-20 15:28:28
AC	11451254188 (22029-mjh)	6ms	440 KiB		393 Bytes	2022-12-17 20:59:17
AC	时代一校 - 冯隆浩 (冯隆浩)	6ms	512 KiB		393 Bytes	2022-10-29 19:34:47
AC	源著校区-宋昊成 (马冬梅)	6ms	436 KiB		312 Bytes	2023-2-25 17:56:44
AC	zlx (xiao)	6ms	392 KiB		296 Bytes	2022-5-24 21:52:35
AC	10255	6ms	6.9 MiB		316 Bytes	2023-7-13 18:36:23
AC	chaikexu	6ms	432 KiB		371 Bytes	2022-11-24 14:07:14
AC	不怎么聪明的家伙 (贺俊楠)	6ms	6.9 MiB		402 Bytes	2023-7-31 17:39:50
AC	周琪渃	6ms	448 KiB		399 Bytes	2022-12-9 21:27:17
AC	xflt_dyp	6ms	6.9 MiB		506 Bytes	2023-7-22 16:17:57