简单密码

状态	递交者	时间	内存	代码	递交时间
AC	姚宏逸	6ms	256 KiB	310 Bytes	2022-5-25 18:30:28
AC	周琪渃	9ms	308 KiB	375 Bytes	2023-3-17 23:14:18
AC	XYZ303	12ms	384 KiB	314 Bytes	2022-5-29 20:43:20
AC	huyinuo	12ms	384 KiB	330 Bytes	2022-5-24 22:19:02
AC	徐子恩 (Cow)	12ms	384 KiB	259 Bytes	2022-6-12 19:36:49
AC	zlx (xiao)	12ms	436 KiB	543 Bytes	2022-5-29 19:05:11
AC	徐子恩 (Cow)	12ms	512 KiB	259 Bytes	2022-6-12 19:36:53
AC	朱泓屹 (ZYH)	12ms	392 KiB	1.3 KiB	2022-5-29 20:36:56
AC	徐子恩 (Cow)	12ms	384 KiB	259 Bytes	2022-6-12 19:36:56
AC	坤坤荔枝小黑子 (zhonghaotian22006)	12ms	384 KiB	308 Bytes	2022-7-2 18:35:42
AC	微风将至 (李睿轩)	12ms	384 KiB	392 Bytes	2022-5-29 19:37:54
AC	徐子恩 (Cow)	12ms	384 KiB	259 Bytes	2022-5-29 21:11:18
AC	李哲 (lizhe)	12ms	384 KiB	344 Bytes	2022-8-1 16:30:21
AC	赵泳鑫 (zhaoyongxin)	12ms	392 KiB	275 Bytes	2022-7-13 19:29:51
AC	甄一阳 (22016-zyy)	12ms	392 KiB	315 Bytes	2022-12-1 19:15:08
AC	zhangheyi22006	12ms	384 KiB	288 Bytes	2022-7-2 18:46:56
AC	徐子恩 (Cow)	13ms	384 KiB	259 Bytes	2022-6-12 19:36:58
AC	徐子恩 (Cow)	13ms	384 KiB	259 Bytes	2022-6-12 19:37:04
AC	马兴宇 (mxy01)	13ms	384 KiB	386 Bytes	2022-12-1 19:24:00
AC	刘老师 (图书管理员)	13ms	384 KiB	454 Bytes	2022-5-24 14:01:59
AC	l;k (陈彬宾)	13ms	396 KiB	439 Bytes	2022-5-29 20:19:26
AC	徐子恩 (Cow)	13ms	392 KiB	259 Bytes	2022-6-12 19:36:46
AC	徐子恩 (Cow)	13ms	392 KiB	259 Bytes	2022-6-12 19:37:10
AC	Randy Marsh (杨子腾)	13ms	384 KiB	361 Bytes	2022-6-5 17:19:19
AC	CMG	13ms	392 KiB	279 Bytes	2022-5-29 20:33:43
AC	刘老师 (图书管理员)	13ms	384 KiB	465 Bytes	2022-5-24 14:02:46
AC	86想要钱 (twt)	13ms	500 KiB	325 Bytes	2023-2-17 18:52:56
AC	luosifu22006	13ms	392 KiB	254 Bytes	2022-8-16 18:15:07
AC	徐子恩 (Cow)	13ms	384 KiB	259 Bytes	2022-6-12 19:37:01
AC	刘锦航	13ms	392 KiB	273 Bytes	2022-6-8 19:51:13
AC	朱老师 (zyp)	13ms	384 KiB	271 Bytes	2022-7-2 19:12:55
AC	李禹衡 (liyuheng22006)	13ms	512 KiB	284 Bytes	2022-7-2 18:37:08
AC	李山水	13ms	384 KiB	432 Bytes	2022-6-12 17:04:48
AC	hzm	13ms	436 KiB	292 Bytes	2022-9-12 22:29:33
AC	朱老师 (zyp)	13ms	396 KiB	271 Bytes	2022-7-2 18:34:56
AC	xiangsiyu	13ms	384 KiB	292 Bytes	2022-7-2 18:37:00
AC	yucaoluyang22006	13ms	384 KiB	283 Bytes	2022-7-2 19:13:48
AC	吴俊成 (wujuncheng)	13ms	384 KiB	371 Bytes	2022-6-6 22:02:51
AC	11111	13ms	440 KiB	275 Bytes	2022-6-8 19:31:22
AC	李哲 (lizhe)	13ms	384 KiB	344 Bytes	2022-8-1 16:33:14
AC	凌肯 (lingken22006)	13ms	384 KiB	287 Bytes	2022-7-2 19:04:39
AC	叶雨昊 (yeyuhao22006)	13ms	384 KiB	288 Bytes	2022-7-2 18:50:10
AC	霍弈丞小号	13ms	384 KiB	277 Bytes	2023-5-7 17:01:00
AC	凌肯 (lingken22006)	14ms	392 KiB	287 Bytes	2022-7-2 19:04:42
AC	Chter	14ms	384 KiB	415 Bytes	2023-5-14 9:36:33
AC	章愉霖	14ms	384 KiB	453 Bytes	2023-5-21 18:01:58
AC	陈杰晟	14ms	400 KiB	297 Bytes	2022-5-29 10:02:24
AC	CK (李弘毅)	14ms	384 KiB	241 Bytes	2023-4-16 11:23:17
AC	张玉坚 (zhangyuian)	14ms	384 KiB	278 Bytes	2023-5-14 20:27:55
AC	时代一校-赵彦博 (zyb)	14ms	440 KiB	260 Bytes	2023-2-7 13:40:02
AC	iLansensei (hjs(Caster))	14ms	392 KiB	331 Bytes	2022-11-6 11:43:27
AC	马渝杭 (mayuhang)	14ms	424 KiB	343 Bytes	2023-2-25 20:41:52
AC	李彭宋代诗人 (ljy123456)	14ms	444 KiB	350 Bytes	2023-4-5 21:26:15
AC	偽艺術家 (chenyanchi22006)	14ms	424 KiB	222 Bytes	2022-8-13 17:07:36
AC	luosifu22006	14ms	512 KiB	254 Bytes	2022-8-19 18:10:39
AC	ttt123	14ms	384 KiB	280 Bytes	2022-12-31 10:50:37
AC	11451254188 (22029-mjh)	14ms	384 KiB	362 Bytes	2022-12-31 10:43:29
AC	时代一校林星宇 (lxy)	14ms	512 KiB	325 Bytes	2023-2-8 21:03:46
AC	(金沙天街)严皓月 (严皓月)	14ms	424 KiB	317 Bytes	2023-5-19 19:09:48
AC	22029-lsl	14ms	384 KiB	258 Bytes	2022-12-31 10:49:47
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)	14ms	384 KiB	321 Bytes	2022-12-31 10:52:25
AC	游智棋	14ms	384 KiB	239 Bytes	2022-12-8 20:31:16
AC	朱老师 (zyp)	14ms	512 KiB	254 Bytes	2022-8-16 18:06:46
AC	王昱祺 (12王昱祺)	14ms	392 KiB	1018 Bytes	2023-5-28 17:23:21
AC	scallway	14ms	512 KiB	283 Bytes	2023-3-24 18:09:06
AC	周琪渃	14ms	384 KiB	345 Bytes	2023-3-17 23:15:16
AC	余彦瑞	14ms	436 KiB	327 Bytes	2023-1-31 11:49:57
AC	林靖明	14ms	440 KiB	299 Bytes	2023-1-31 20:28:20
AC	colin1112 (墙凌可)	15ms	384 KiB	598 Bytes	2023-3-21 19:23:31
AC	22029-zjs	15ms	436 KiB	292 Bytes	2022-12-31 10:50:08
AC	zcx	15ms	384 KiB	251 Bytes	2022-12-31 10:50:33
AC	陈骏逸 (chenjunyi)	15ms	384 KiB	259 Bytes	2022-12-8 20:29:23
AC	缥 (王硕2012)	15ms	436 KiB	352 Bytes	2023-3-5 20:03:35
AC	周琪渃	15ms	384 KiB	345 Bytes	2023-3-17 23:16:22
AC	22029-lyh	15ms	384 KiB	339 Bytes	2022-12-31 10:53:07
AC	lys	15ms	432 KiB	260 Bytes	2022-9-10 20:42:25
AC	时代校区-刘臣原 (微笑王子)	15ms	384 KiB	288 Bytes	2022-9-10 20:58:57
AC	zhangzhimo	15ms	520 KiB	362 Bytes	2022-12-3 16:03:14
AC	赵沛喆	15ms	392 KiB	523 Bytes	2022-10-23 11:08:59
AC	时代一校-曾科智 (曾科智)	15ms	444 KiB	289 Bytes	2023-3-4 19:03:41
AC	wuqilin	15ms	512 KiB	347 Bytes	2022-12-31 17:28:32
AC	时代一校-王宥量 (wangyouliang)	15ms	428 KiB	306 Bytes	2022-12-8 19:39:45
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	15ms	436 KiB	260 Bytes	2023-2-1 16:43:39
AC	lch (凌昌瀚)	15ms	432 KiB	260 Bytes	2022-9-9 20:46:33
AC	陈雨泽1	15ms	440 KiB	268 Bytes	2023-1-31 17:57:05
AC	wangjun	15ms	6.7 MiB	261 Bytes	2023-11-15 14:46:13
AC	hxb	15ms	512 KiB	307 Bytes	2023-3-24 18:06:58
AC	lch (凌昌瀚)	15ms	512 KiB	260 Bytes	2022-12-9 20:28:19
AC	无尽的想象 (谭仕高)	16ms	444 KiB	322 Bytes	2022-8-30 21:16:21
AC	ttt123	16ms	512 KiB	275 Bytes	2022-12-10 21:23:35
AC	黄梓桐 (HuangZiTong)	16ms	384 KiB	320 Bytes	2023-1-15 14:47:40
AC	原著校区巫映秋 (巫映秋1a)	16ms	512 KiB	296 Bytes	2023-5-28 16:34:38
AC	蒲梓勋 (puzixun)	16ms	436 KiB	459 Bytes	2022-12-8 19:16:17
AC	喻文博 (22016-ywb)	16ms	436 KiB	278 Bytes	2022-12-11 11:34:43
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	16ms	440 KiB	347 Bytes	2022-12-25 10:17:20
AC	zhm123	17ms	384 KiB	268 Bytes	2023-1-14 19:26:50
AC	colin1112 (墙凌可)	17ms	440 KiB	566 Bytes	2023-3-21 19:23:12
AC	22016-oyc	17ms	432 KiB	297 Bytes	2022-12-11 10:48:12
AC	ycy	18ms	512 KiB	256 Bytes	2022-12-8 20:27:07
AC	Tender. (05c05-zhou)	20ms	432 KiB	298 Bytes	2022-11-7 19:54:32