满足条件的数

状态	递交者	时间	内存	代码	递交时间
AC	MoonLight ( aaa)	14ms	448 KiB	195 Bytes	2022-2-19 9:35:41
AC	苏信泽	14ms	412 KiB	165 Bytes	2023-3-11 20:23:29
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	384 KiB	197 Bytes	2023-4-15 17:24:37
AC	JOKER (hhy)	15ms	6.8 MiB	171 Bytes	2023-10-13 14:12:25
AC	漆星语 (qixingyu)	15ms	392 KiB	5.6 KiB	2023-3-11 10:50:56
AC	huanglu	15ms	412 KiB	215 Bytes	2022-12-11 18:16:56
AC	hnd (陈皓洋)	15ms	388 KiB	235 Bytes	2022-8-22 10:25:39
AC	赵一嵘 (zhaoyirong)	15ms	432 KiB	181 Bytes	2023-3-1 22:19:16
AC	朱泽晟	15ms	512 KiB	211 Bytes	2022-8-27 15:45:13
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	384 KiB	197 Bytes	2023-4-15 17:25:40
AC	叶哲宇 (yzy)	15ms	436 KiB	169 Bytes	2023-4-26 19:00:11
AC	金锦泽 (jinjinze)	15ms	6.8 MiB	173 Bytes	2023-10-3 10:59:01
AC	hxb	15ms	440 KiB	213 Bytes	2022-9-17 17:11:11
AC	zhoumingze23017	15ms	6.7 MiB	200 Bytes	2023-8-31 11:43:02
AC	陈廷恩	15ms	6.9 MiB	180 Bytes	2023-10-13 20:36:10
AC	第五人格启动 (罗子键)	15ms	384 KiB	188 Bytes	2023-3-11 20:33:30
AC	yixingyou	15ms	512 KiB	161 Bytes	2022-9-10 17:20:25
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	384 KiB	197 Bytes	2023-4-15 17:24:40
AC	朱老师 (zyp)	15ms	512 KiB	177 Bytes	2022-11-16 19:15:53
AC	向俊熙 (xiangjunxi23003)	15ms	392 KiB	200 Bytes	2023-3-22 16:41:31
AC	lizhengqian19	15ms	6.8 MiB	200 Bytes	2023-6-12 15:05:57
AC	朱老师 (zyp)	15ms	476 KiB	200 Bytes	2022-7-28 11:50:26
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	392 KiB	197 Bytes	2023-4-15 17:24:40
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	384 KiB	197 Bytes	2023-4-15 17:25:40
AC	曹元明	15ms	424 KiB	170 Bytes	2022-9-3 19:04:41
AC	第五人格启动 (罗子键)	15ms	384 KiB	188 Bytes	2023-3-11 20:33:30
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	384 KiB	197 Bytes	2023-4-15 17:24:40
AC	yezhiheng	15ms	436 KiB	181 Bytes	2022-1-16 10:50:18
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	384 KiB	197 Bytes	2023-4-15 17:25:36
AC	SB (mfy01)	15ms	428 KiB	180 Bytes	2022-12-2 13:51:22
AC	第五人格启动 (罗子键)	15ms	384 KiB	188 Bytes	2023-3-11 20:33:30
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	384 KiB	197 Bytes	2023-4-15 17:24:44
AC	没有此人 (akm)	15ms	6.9 MiB	216 Bytes	2023-7-4 16:26:19
AC	钟睿煊 (zhongruixuan)	15ms	512 KiB	160 Bytes	2023-5-7 19:48:51
AC	杨淇瑞 (杨淇瑞29)	15ms	6.8 MiB	223 Bytes	2023-10-7 20:05:01
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	384 KiB	197 Bytes	2023-4-15 17:25:34
AC	U城校区-郭旻哲 (郭旻哲)	15ms	6.7 MiB	198 Bytes	2023-9-3 21:21:57
AC	徐子恩 (Cow)	15ms	432 KiB	223 Bytes	2022-2-20 12:05:11
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	384 KiB	197 Bytes	2023-4-15 17:25:34
AC	黄立信	15ms	432 KiB	208 Bytes	2022-12-4 18:21:13
AC	老六（王牌） (mhc)	15ms	512 KiB	182 Bytes	2023-3-29 19:28:44
AC	﹢•﹡🕉☽✝⚜Halanfus⚜✝☾⚔⚝﹡﹢• (黄子瑞)	15ms	6.7 MiB	199 Bytes	2023-9-5 21:49:17
AC	吃小孩的viv_	15ms	444 KiB	188 Bytes	2022-8-20 12:06:22
AC	黄彦熹 (AK-203)	15ms	428 KiB	170 Bytes	2023-3-19 15:45:30
AC	zhangheyi22006	15ms	436 KiB	198 Bytes	2022-11-3 18:29:50
AC	时代2校-程俊燃 (chengjunran)	15ms	388 KiB	165 Bytes	2023-4-15 17:28:07
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	384 KiB	197 Bytes	2023-4-15 17:24:49
AC	cupy战士 (05c05-dkf)	15ms	6.9 MiB	172 Bytes	2023-9-24 11:36:50
AC	丛林 (conglin)	15ms	440 KiB	184 Bytes	2022-12-2 21:25:05
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	384 KiB	197 Bytes	2023-4-15 17:25:35
AC	德克萨斯做的到吗 (liyangbao)	15ms	432 KiB	229 Bytes	2022-11-7 23:00:41
AC	新壹街校区-陈琬舒 (空空大师)	15ms	6.8 MiB	167 Bytes	2023-10-16 21:21:05
AC	呵呵呵 (陈思琦)	15ms	436 KiB	156 Bytes	2022-9-10 16:54:31
AC	新壹街.曾祥睿 (zxr)	15ms	6.7 MiB	179 Bytes	2023-8-30 16:22:14
AC	wzzjnb2012	15ms	448 KiB	255 Bytes	2022-9-29 21:50:16
AC	没有此人 (akm)	15ms	7 MiB	213 Bytes	2023-12-3 14:13:26
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	15ms	512 KiB	181 Bytes	2022-8-31 18:42:00
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	384 KiB	197 Bytes	2023-4-15 17:25:40
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	392 KiB	197 Bytes	2023-4-15 17:24:41
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	392 KiB	197 Bytes	2023-4-15 17:24:39
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	392 KiB	197 Bytes	2023-4-15 17:24:41
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	15ms	424 KiB	187 Bytes	2022-11-11 16:52:23
AC	赵彬鸿	15ms	392 KiB	150 Bytes	2022-8-13 14:15:46
AC	zcx	15ms	384 KiB	175 Bytes	2022-10-29 11:41:21
AC	Nico	15ms	440 KiB	169 Bytes	2023-4-16 14:38:36
AC	牟淳雅	15ms	6.9 MiB	193 Bytes	2023-7-24 0:32:20
AC	wuqilin	15ms	440 KiB	192 Bytes	2022-9-17 17:41:04
AC	zyl	15ms	7 MiB	230 Bytes	2024-1-3 17:38:41
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)	15ms	512 KiB	182 Bytes	2022-11-5 11:22:06
AC	xzf	15ms	6.9 MiB	234 Bytes	2023-9-3 11:52:19
AC	时代一校-曾科智 (曾科智)	15ms	444 KiB	169 Bytes	2023-2-25 19:43:26
AC	周琪渃	15ms	452 KiB	229 Bytes	2022-12-9 20:08:45
AC	杨浩灵 (金坷拉)	15ms	432 KiB	238 Bytes	2023-1-4 22:58:05
AC	孙烽轶 (sfy)	15ms	440 KiB	185 Bytes	2022-9-11 10:54:27
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	384 KiB	197 Bytes	2023-4-15 17:25:35
AC	zzl	15ms	6.8 MiB	167 Bytes	2023-11-7 0:26:14
AC	源著校区-宋昊成 (马冬梅)	15ms	432 KiB	214 Bytes	2023-2-25 18:09:33
AC	yuhaodi	15ms	440 KiB	243 Bytes	2023-4-24 18:41:43
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	384 KiB	197 Bytes	2023-4-15 17:24:40
AC	王祎辰 (wangyichen)	15ms	6.8 MiB	220 Bytes	2023-6-29 18:59:58
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	384 KiB	197 Bytes	2023-4-15 17:24:39
AC	hnd (陈皓洋)	15ms	444 KiB	235 Bytes	2022-8-29 10:37:27
AC	hnd (陈皓洋)	15ms	392 KiB	235 Bytes	2022-8-22 10:28:51
AC	谁陪訫牞（杀手） (22029-zys)	15ms	384 KiB	176 Bytes	2023-1-4 18:09:15
AC	第五人格启动 (罗子键)	15ms	384 KiB	188 Bytes	2023-3-11 20:33:31
AC	李旻轩	15ms	436 KiB	257 Bytes	2023-4-8 9:19:43
AC	时代二校-陈天成 (鸭缩毛巾)	15ms	384 KiB	164 Bytes	2023-4-15 17:27:31
AC	zvt_132 (任子轩)	16ms	6.9 MiB	139 Bytes	2023-8-2 19:03:03
AC	罗莎莎	16ms	6.7 MiB	199 Bytes	2023-9-2 10:16:07
AC	第五人格启动 (罗子键)	16ms	384 KiB	188 Bytes	2023-3-11 20:33:31
AC	钟元朗	16ms	6.9 MiB	203 Bytes	2023-8-13 19:47:01
AC	弹射起飞 ? 冲 ! (吴周周)	16ms	384 KiB	197 Bytes	2023-4-15 17:24:46
AC	坤坤荔枝小黑子 (zhonghaotian22006)	16ms	540 KiB	193 Bytes	2022-9-6 20:25:50
AC	何欣洋	16ms	384 KiB	204 Bytes	2023-4-8 9:53:44
AC	弹射起飞 ? 冲 ! (吴周周)	16ms	392 KiB	197 Bytes	2023-4-15 17:25:35
AC	wuzhenghan	16ms	432 KiB	195 Bytes	2022-10-23 10:57:50
AC	小忙果 (王昱杰)	16ms	436 KiB	172 Bytes	2023-3-19 16:59:35
AC	王昱祺 (12王昱祺)	16ms	548 KiB	191 Bytes	2023-3-26 17:14:02
AC	陈雨泽1	16ms	512 KiB	227 Bytes	2023-2-18 11:08:22
AC	马渝杭 (mayuhang)	16ms	512 KiB	181 Bytes	2023-3-21 19:26:51