恺撒加密术

状态	递交者	时间	内存	语言	代码	递交时间
AC	姚宏逸	6ms	256 KiB		273 Bytes	2022-8-19 18:09:40
AC	zyl	7ms	7.3 MiB		419 Bytes	2024-1-16 18:43:54
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	10ms	7.4 MiB		592 Bytes	2023-11-23 19:39:56
AC	wangjun	12ms	7.2 MiB		301 Bytes	2023-11-26 15:33:53
AC	05c35-rjx	12ms	392 KiB		398 Bytes	2022-6-14 22:24:57
AC	原著校区巫映秋 (巫映秋1a)	12ms	7 MiB	C++98	448 Bytes	2024-6-28 23:01:05
AC	文硕 (文硕1)	12ms	392 KiB		620 Bytes	2022-7-12 11:53:01
AC	何昊宇 (22016-hhy)	12ms	384 KiB		327 Bytes	2022-9-11 12:03:01
AC	iLansensei (hjs(Caster))	12ms	384 KiB		390 Bytes	2022-6-15 17:22:05
AC	CMG	12ms	384 KiB		394 Bytes	2022-6-5 20:29:02
AC	yxj	12ms	448 KiB		398 Bytes	2022-6-14 22:23:01
AC	张泰凌 (ztl)	12ms	384 KiB		567 Bytes	2022-2-13 10:54:05
AC	Accepted (周芷乐)	12ms	6.7 MiB	C++14	301 Bytes	2024-7-20 12:37:32
AC	张瑞博	13ms	6.8 MiB	C++11	355 Bytes	2024-8-14 13:29:32
AC	22016-yzq	13ms	412 KiB		428 Bytes	2022-9-11 12:12:26
AC	黄彦熹 (AK-203)	13ms	384 KiB		399 Bytes	2023-2-26 19:42:02
AC	Jose (反恐皮蛋)	13ms	6.8 MiB	C++98	616 Bytes	2024-7-3 11:25:42
AC	22029-zjs	13ms	400 KiB		467 Bytes	2023-2-16 19:02:35
AC	wjx	13ms	436 KiB		386 Bytes	2022-9-11 12:03:31
AC	10255	13ms	384 KiB		460 Bytes	2022-7-21 11:14:28
AC	新一街校区Jason_LuoYouZheng (罗友峥)	13ms	384 KiB		349 Bytes	2022-2-15 14:14:34
AC	xiangsiyu	13ms	384 KiB		330 Bytes	2022-8-5 11:58:44
AC	李树崑 (lishukun)	13ms	392 KiB		537 Bytes	2022-8-3 18:04:34
AC	17779	13ms	384 KiB		303 Bytes	2022-4-4 17:26:48
AC	ywh	13ms	384 KiB		566 Bytes	2022-2-13 11:03:12
AC	22016-oyc	13ms	384 KiB		327 Bytes	2022-9-11 11:59:58
AC	右边的右边的人是SB (22016-hjy)	13ms	384 KiB		389 Bytes	2022-9-11 12:15:54
AC	10255	13ms	384 KiB		462 Bytes	2022-7-21 11:15:22
AC	甄一阳 (22016-zyy)	13ms	384 KiB		403 Bytes	2022-9-11 11:48:55
AC	22016-ggs	13ms	384 KiB		1.5 KiB	2022-9-11 12:07:25
AC	22016-tlr	13ms	384 KiB		374 Bytes	2022-9-11 12:03:06
AC	梅子楠 (22016-mzn)	13ms	396 KiB		327 Bytes	2022-9-11 12:03:16
AC	陈杰晟	13ms	456 KiB		694 Bytes	2022-2-13 10:48:30
AC	xiongxinyao	13ms	392 KiB		349 Bytes	2023-2-1 11:19:36
AC	ycy	13ms	384 KiB		399 Bytes	2022-6-18 17:00:11
AC	XYZ303	13ms	428 KiB		316 Bytes	2022-6-5 19:42:46
AC	梁程翔	13ms	7.3 MiB	C++17	335 Bytes	2024-5-18 14:38:18
AC	zhangruijie	13ms	6.9 MiB	C++98(O2)	362 Bytes	2024-8-23 15:28:38
AC	张祖名	13ms	6.9 MiB	C++98(O2)	378 Bytes	2024-7-2 22:17:07
AC	cupy战士 (05c05-dkf)	13ms	436 KiB		362 Bytes	2023-4-1 22:56:36
AC	文硕 (文硕1)	13ms	412 KiB		620 Bytes	2022-7-12 11:53:30
AC	无尽的想象 (谭仕高)	13ms	6.8 MiB	C++11	400 Bytes	2024-8-9 16:31:07
AC	朱老师 (zyp)	13ms	384 KiB		447 Bytes	2022-8-5 11:51:41
AC	zlx (xiao)	13ms	384 KiB		584 Bytes	2022-6-5 20:14:24
AC	12345	13ms	384 KiB		378 Bytes	2022-2-15 14:17:26
AC	周琪渃	13ms	384 KiB		528 Bytes	2023-1-3 21:29:00
AC	朱老师 (zyp)	13ms	6.8 MiB		467 Bytes	2023-10-2 19:40:16
AC	芒苒忧 (廖迦南)	13ms	444 KiB		449 Bytes	2022-8-3 15:07:02
AC	ycy	13ms	392 KiB		399 Bytes	2022-6-18 17:00:14
AC	疯神芭芭脱丝 (李卓修)	13ms	392 KiB		594 Bytes	2022-7-11 14:00:30
AC	1396013295	13ms	440 KiB		596 Bytes	2022-5-29 10:20:25
AC	xmw318046	13ms	6.4 MiB	C++98	312 Bytes	2024-7-5 18:37:07
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)	13ms	384 KiB		401 Bytes	2023-2-18 9:16:17
AC	杜是贤 (dushixian)	13ms	448 KiB		350 Bytes	2023-1-29 20:09:47
AC	盗号者该死 (陶欣垚)	13ms	7 MiB	C++17	322 Bytes	2024-5-26 15:40:16
AC	huanglu	13ms	6.8 MiB		420 Bytes	2023-6-10 20:47:09
AC	陈杰晟	13ms	384 KiB		424 Bytes	2022-2-15 14:12:47
AC	赵一嵘 (zhaoyirong)	13ms	384 KiB		414 Bytes	2022-2-15 14:16:50
AC	zlx (xiao)	14ms	440 KiB		584 Bytes	2022-6-5 19:34:53
AC	源著校区-宋昊成 (马冬梅)	14ms	448 KiB		588 Bytes	2023-2-26 19:37:04
AC	CPL	14ms	392 KiB		349 Bytes	2022-5-3 19:01:30
AC	12345	14ms	384 KiB		378 Bytes	2022-2-15 14:17:25
AC	无尽的想象 (谭仕高)	14ms	6.8 MiB		418 Bytes	2023-10-9 19:21:49
AC	LukeDid	14ms	444 KiB		421 Bytes	2023-4-22 18:54:41
AC	tongxiao	14ms	7.1 MiB	C++20(O2)	393 Bytes	2024-6-26 14:26:01
AC	Yuan (Zongzi1)	14ms	6.6 MiB	C++17(O2)	595 Bytes	2024-7-21 9:59:37
AC	中岛敦 (黄麒瑞)	14ms	6.8 MiB		498 Bytes	2023-10-3 11:30:35
AC	ymh	14ms	384 KiB		380 Bytes	2022-2-15 14:32:40
AC	经常消失 (小萝卜)	14ms	384 KiB		421 Bytes	2022-2-15 14:12:28
AC	阮 (媚狐不吃道旁李)	14ms	7.2 MiB	C++98	370 Bytes	2024-5-2 16:36:13
AC	ttt123	14ms	436 KiB		335 Bytes	2023-2-17 22:54:07
AC	偽艺術家 (chenyanchi22006)	14ms	444 KiB		243 Bytes	2022-8-15 22:22:58
AC	12345	14ms	412 KiB		378 Bytes	2022-2-15 14:17:21
AC	任童(rentong)	14ms	436 KiB		445 Bytes	2022-7-2 15:07:23
AC	12345	14ms	392 KiB		378 Bytes	2022-2-15 14:17:25
AC	张梓浩 (zhangzihao)	14ms	384 KiB		336 Bytes	2023-4-8 11:55:03
AC	huyinuo	14ms	384 KiB		559 Bytes	2022-2-20 20:10:43
AC	zhoumingze23017	14ms	6.7 MiB		401 Bytes	2023-9-5 17:36:30
AC	SYC0226	14ms	432 KiB		296 Bytes	2022-3-20 14:34:39
AC	时代一校林星宇 (lxy)	14ms	6.8 MiB		277 Bytes	2023-7-4 13:30:32
AC	colin1112 (墙凌可)	14ms	6.7 MiB		496 Bytes	2023-9-1 17:13:01
AC	pandap&a王皓宸 (WANGHAOCHEN)	14ms	384 KiB		475 Bytes	2023-4-8 8:25:09
AC	梨冻亿 (wiueh)	14ms	436 KiB		433 Bytes	2022-1-23 18:41:22
AC	新壹街+黄路+江宇轩 (江宇轩)	14ms	7 MiB		328 Bytes	2024-1-4 20:42:48
AC	何洋名 (heyangming)	14ms	6.9 MiB		553 Bytes	2023-7-4 11:51:22
AC	12345	14ms	392 KiB		378 Bytes	2022-2-15 14:17:26
AC	南坪校区—喻子峰 (yuzifeng23002)	14ms	6.8 MiB		346 Bytes	2023-10-2 19:22:57
AC	爱琴海校区-刁钲洋 (刁钲洋)	14ms	7.3 MiB		464 Bytes	2023-7-4 11:36:25
AC	周琪渃	14ms	392 KiB		529 Bytes	2023-1-3 21:30:08
AC	luoluonuoya	14ms	428 KiB		427 Bytes	2022-8-12 15:58:26
AC	ymh	14ms	392 KiB		380 Bytes	2022-2-15 14:32:40
AC	朱老师 (zyp)	14ms	384 KiB		399 Bytes	2022-9-11 11:54:11
AC	12345	14ms	392 KiB		378 Bytes	2022-2-15 14:17:25
AC	12345	14ms	384 KiB		378 Bytes	2022-2-15 14:17:26
AC	赵泳鑫 (zhaoyongxin)	14ms	444 KiB		620 Bytes	2022-7-12 11:28:55
AC	ymh	14ms	384 KiB		380 Bytes	2022-2-15 14:32:40
AC	朱老师 (zyp)	14ms	432 KiB		455 Bytes	2023-2-16 18:46:11
AC	在煎鱼的肖大总铳 (肖宇航)	14ms	6.8 MiB		374 Bytes	2023-9-24 11:24:31
AC	杨坤霖 (steven)	14ms	384 KiB		584 Bytes	2023-1-15 15:46:52
AC	罗翌珂 (dangdang)	14ms	436 KiB		420 Bytes	2022-8-28 10:58:32