满足条件的数

状态	递交者	时间	内存	语言	代码	递交时间
AC	何洋名 (heyangming)	14ms	512 KiB		175 Bytes	2022-3-11 16:34:04
AC	ttz	14ms	512 KiB		179 Bytes	2022-3-6 9:38:18
AC	黄px	14ms	6.8 MiB	C++11	173 Bytes	2024-8-14 14:40:45
AC	况奕辛 (KYX_yyds)	14ms	512 KiB		263 Bytes	2022-2-25 20:14:42
AC	leisixian (22029-lyh)	14ms	384 KiB		194 Bytes	2022-11-5 11:30:15
AC	yanglang	14ms	492 KiB		166 Bytes	2022-10-22 16:27:18
AC	56 (13883454928)	14ms	432 KiB		190 Bytes	2022-2-13 19:01:59
AC	邵冠铖 (shaoguancheng22031)	14ms	392 KiB		162 Bytes	2022-11-16 19:18:11
AC	弹射起飞 ? 冲 ! (吴周周)	14ms	428 KiB		197 Bytes	2023-4-15 17:25:41
AC	谭懿轩 (yanyixuan)	14ms	424 KiB		154 Bytes	2022-2-15 14:42:29
AC	罗元邑2	14ms	384 KiB		218 Bytes	2023-4-8 10:06:06
AC	邬文博 (wwb)	14ms	384 KiB		170 Bytes	2023-4-9 12:06:41
AC	. (Pig)	14ms	424 KiB		190 Bytes	2022-3-13 9:24:06
AC	罗兰（漆黑襟默) (zhangxiaoci)	14ms	440 KiB		178 Bytes	2022-8-29 14:22:57
AC	xuniaoyin (徐袅音)	14ms	6.8 MiB		178 Bytes	2023-9-17 15:32:15
AC	赵彬鸿	14ms	392 KiB		150 Bytes	2022-8-13 14:15:44
AC	李树崑 (lishukun)	14ms	384 KiB		199 Bytes	2022-11-5 12:19:06
AC	Randy Marsh (杨子腾)	14ms	384 KiB		202 Bytes	2022-1-22 11:11:51
AC	在煎鱼的肖大总铳 (肖宇航)	14ms	6.8 MiB		223 Bytes	2023-10-12 21:48:42
AC	wangjunhan	14ms	512 KiB		194 Bytes	2022-4-26 19:19:52
AC	ttt123	14ms	392 KiB		196 Bytes	2022-11-5 11:22:56
AC	赵彬鸿	14ms	384 KiB		150 Bytes	2022-8-13 14:15:45
AC	22029-lsl	14ms	384 KiB		227 Bytes	2022-11-5 11:31:30
AC	曹烜豪	14ms	384 KiB		174 Bytes	2023-3-11 20:25:44
AC	赵泳鑫 (zhaoyongxin)	14ms	436 KiB		193 Bytes	2022-4-23 17:42:58
AC	李彦臻	14ms	6.8 MiB		190 Bytes	2023-9-29 14:54:54
AC	弹射起飞 ? 冲 ! (吴周周)	14ms	384 KiB		197 Bytes	2023-4-15 17:25:41
AC	蒲梓勋 (puzixun)	14ms	436 KiB		227 Bytes	2022-9-13 21:51:08
AC	22029-zjs	14ms	384 KiB		212 Bytes	2022-11-5 12:20:01
AC	炸鱼4000+ (dxc)	14ms	476 KiB		200 Bytes	2023-3-11 20:23:28
AC	罗翌珂 (dangdang)	14ms	436 KiB		200 Bytes	2022-8-22 11:06:31
AC	缥 (王硕2012)	14ms	512 KiB		235 Bytes	2022-10-23 20:09:29
AC	疯神芭芭脱丝 (李卓修)	14ms	436 KiB		198 Bytes	2022-7-16 13:47:15
AC	弹射起飞 ? 冲 ! (吴周周)	14ms	412 KiB		197 Bytes	2023-4-15 17:24:49
AC	赵彬鸿	14ms	384 KiB		150 Bytes	2022-8-13 14:15:45
AC	李禹衡 (liyuheng22006)	14ms	384 KiB		163 Bytes	2022-6-5 20:40:36
AC	TBB (杜昊燃)	14ms	512 KiB		187 Bytes	2022-4-9 11:22:29
AC	赵彬鸿	14ms	384 KiB		150 Bytes	2022-8-13 14:15:49
AC	赵彬鸿	14ms	412 KiB		150 Bytes	2022-8-13 14:15:47
AC	胡澜之 (666hlz666)	14ms	428 KiB		230 Bytes	2023-4-25 19:24:24
AC	ganlin1	14ms	6.9 MiB		161 Bytes	2023-7-17 14:18:24
AC	张瑞博	14ms	7.2 MiB	C++11	170 Bytes	2024-4-20 23:19:44
AC	你猜呀	14ms	384 KiB		173 Bytes	2023-3-12 11:25:05
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		170 Bytes	2022-10-29 10:27:31
AC	xiongxinyao	14ms	392 KiB		271 Bytes	2022-10-21 20:40:26
AC	执剑人罗辑 (Jasson)	14ms	392 KiB		169 Bytes	2022-10-23 21:11:31
AC	xxteacher	14ms	384 KiB		316 Bytes	2022-2-8 15:58:30
AC	第五人格启动 (罗子键)	14ms	384 KiB		188 Bytes	2023-3-11 20:33:29
AC	zhangyouze (张佑泽)	14ms	7.1 MiB		182 Bytes	2023-10-21 18:06:17
AC	tyx_9192596	14ms	392 KiB		178 Bytes	2023-3-17 18:43:01
AC	中岛敦 (黄麒瑞)	14ms	6.7 MiB		194 Bytes	2023-9-29 10:20:26
AC	灶门炭治郎：火之神神乐	14ms	384 KiB		190 Bytes	2023-4-15 17:29:24
AC	疯神芭芭脱丝 (李卓修)	14ms	384 KiB		210 Bytes	2022-1-25 16:37:46
AC	郑尧 (zhengyao)	14ms	6.8 MiB		170 Bytes	2023-10-21 9:46:28
AC	刘蕤箎	14ms	6.8 MiB		155 Bytes	2023-10-20 20:32:54
AC	凌肯 (lingken22006)	14ms	384 KiB		201 Bytes	2022-7-26 22:04:39
AC	CK (李弘毅)	14ms	428 KiB		151 Bytes	2022-8-17 16:33:01
AC	弹射起飞 ? 冲 ! (吴周周)	14ms	392 KiB		197 Bytes	2023-4-15 17:25:38
AC	文硕 (文硕1)	14ms	512 KiB		173 Bytes	2022-2-6 13:47:10
AC	陈杰晟	14ms	436 KiB		192 Bytes	2022-2-22 13:16:12
AC	余多多29	14ms	440 KiB		215 Bytes	2023-4-28 23:15:29
AC	刘致言	14ms	384 KiB		192 Bytes	2023-3-11 9:28:01
AC	吴攸 (wuyou)	14ms	392 KiB		160 Bytes	2023-3-31 19:53:07
AC	奇怪的正义人！ (leweiqi)	14ms	512 KiB		185 Bytes	2023-4-9 15:02:32
AC	弹射起飞 ? 冲 ! (吴周周)	14ms	420 KiB		197 Bytes	2023-4-15 17:24:47
AC	弹射起飞 ? 冲 ! (吴周周)	14ms	384 KiB		197 Bytes	2023-4-15 17:25:36
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	14ms	6.7 MiB		159 Bytes	2023-9-2 11:49:41
AC	星野光 (Hoshino Hikari)	14ms	6.8 MiB		239 Bytes	2023-10-22 22:51:33
AC	弹射起飞 ? 冲 ! (吴周周)	14ms	384 KiB		197 Bytes	2023-4-15 17:25:38
AC	一片落叶 (yeyuhao)	14ms	6.7 MiB		161 Bytes	2023-8-28 20:21:03
AC	弹射起飞 ? 冲 ! (吴周周)	14ms	384 KiB		197 Bytes	2023-4-15 17:24:44
AC	sb (吴振宇)	14ms	440 KiB		195 Bytes	2023-4-22 19:44:04
AC	弹射起飞 ? 冲 ! (吴周周)	14ms	392 KiB		197 Bytes	2023-4-15 17:21:38
AC	陈于硕(我™的) (chenyu)	14ms	6.8 MiB		202 Bytes	2023-6-9 22:00:16
AC	赵彬鸿	14ms	512 KiB		150 Bytes	2022-8-13 14:15:37
AC	huyinuo	14ms	440 KiB		206 Bytes	2022-3-13 21:31:00
AC	弹射起飞 ? 冲 ! (吴周周)	14ms	392 KiB		197 Bytes	2023-4-15 17:24:38
AC	陈梓宇	14ms	7.2 MiB		174 Bytes	2023-8-24 15:30:02
AC	弹射起飞 ? 冲 ! (吴周周)	14ms	384 KiB		197 Bytes	2023-4-15 17:24:43
AC	赵启程 (赵启程1)	14ms	424 KiB		178 Bytes	2023-3-18 19:34:35
AC	靳博然 (jbr)	14ms	384 KiB		202 Bytes	2023-3-19 18:03:45
AC	南坪校区-淡昌盛 (Dancs)	14ms	6.8 MiB		193 Bytes	2023-10-26 19:38:06
AC	熊海阳 (xiongxaiyang)	14ms	6.9 MiB		168 Bytes	2023-8-13 8:58:13
AC	05c05-zjk	14ms	384 KiB		204 Bytes	2023-2-19 15:08:26
AC	xflt_dyp	14ms	6.9 MiB		246 Bytes	2023-7-22 16:39:53
AC	潘光瑞 (NB牛牛大师)	14ms	512 KiB		214 Bytes	2022-8-11 10:42:01
AC	时代一校蒋帛希 (13983392730)	14ms	6.9 MiB		166 Bytes	2023-7-9 14:04:27
AC	弹射起飞 ? 冲 ! (吴周周)	14ms	392 KiB		197 Bytes	2023-4-15 17:34:07
AC	弹射起飞 ? 冲 ! (吴周周)	14ms	384 KiB		197 Bytes	2023-4-15 17:24:38
AC	弹射起飞 ? 冲 ! (吴周周)	14ms	392 KiB		197 Bytes	2023-4-15 17:25:35
AC	杨在云 (yangzaiyun001)	14ms	384 KiB		149 Bytes	2022-8-30 10:41:39
AC	弹射起飞 ? 冲 ! (吴周周)	14ms	392 KiB		197 Bytes	2023-4-15 17:25:28
AC	hnd (陈皓洋)	14ms	384 KiB		235 Bytes	2022-8-22 10:28:51
AC	苏庭毅	14ms	384 KiB		202 Bytes	2023-3-18 19:24:20
AC	新壹街校区-陈品烨 (陈品烨)	14ms	6.8 MiB		164 Bytes	2023-10-2 13:34:31
AC	miku (阳沐珊)	14ms	512 KiB		190 Bytes	2023-3-23 17:51:43
AC	zzzrrrxxx	14ms	6.9 MiB		172 Bytes	2023-7-16 14:19:20
AC	时代一校-赵彦博 (zyb)	14ms	7.2 MiB		198 Bytes	2023-11-30 18:56:34
AC	刘思齐	14ms	6.6 MiB	C++98	192 Bytes	2024-7-31 14:22:13
AC	甄一阳 (22016-zyy)	14ms	6.8 MiB		218 Bytes	2023-6-10 18:02:01