猴子吃桃问题

状态	递交者	时间	内存	语言	代码	递交时间
AC	MacrozClick_ (蒋淞霖)	14ms	256 KiB		382 Bytes	2022-1-26 16:29:38
AC	姚宏逸	15ms	316 KiB	C	382 Bytes	2022-2-17 19:43:46
AC	Guest	25ms	6.6 MiB	C++98(O2)	253 Bytes	2024-7-27 18:13:01
AC	文硕 (文硕1)	27ms	384 KiB		225 Bytes	2022-7-12 13:40:35
AC	疯神芭芭脱丝 (李卓修)	27ms	512 KiB		211 Bytes	2022-6-9 19:09:52
AC	05c30-dyh	27ms	400 KiB		340 Bytes	2022-2-26 15:52:47
AC	wangjunhan	27ms	384 KiB		270 Bytes	2022-6-18 16:03:05
AC	luoluonuoya	27ms	384 KiB		407 Bytes	2022-6-18 15:59:20
AC	黄梓轩 (huangzixuan)	27ms	384 KiB		278 Bytes	2023-5-21 13:19:43
AC	kql1	27ms	7.1 MiB	C++98	244 Bytes	2024-5-9 13:37:06
AC	李倾城的忠实假粉 (向熠可)	28ms	384 KiB		243 Bytes	2022-3-29 21:18:54
AC	缥 (王硕2012)	28ms	396 KiB		355 Bytes	2023-5-13 12:06:53
AC	huyinuo	28ms	384 KiB		264 Bytes	2022-7-17 21:19:39
AC	赵毕岑	28ms	384 KiB		245 Bytes	2022-1-23 8:39:53
AC	lyx2000pro	28ms	384 KiB		311 Bytes	2022-2-26 16:05:17
AC	_PXY_	28ms	392 KiB		231 Bytes	2022-1-23 11:22:49
AC	05c05-hzy	28ms	392 KiB		214 Bytes	2023-2-26 11:46:54
AC	11451254188 (22029-mjh)	28ms	512 KiB		218 Bytes	2023-5-13 12:01:21
AC	22029-lsl	28ms	392 KiB		263 Bytes	2023-5-13 12:07:59
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	28ms	6.8 MiB	C++98	199 Bytes	2024-8-3 21:27:43
AC	唐良瑞 (22016-tlr01)	28ms	384 KiB		229 Bytes	2023-2-26 11:35:19
AC	何昊宇 (22016-hhy)	28ms	392 KiB		266 Bytes	2023-2-26 11:37:04
AC	1396013295	28ms	392 KiB		282 Bytes	2022-3-21 20:58:13
AC	Jose (反恐皮蛋)	28ms	436 KiB		401 Bytes	2022-7-27 8:32:30
AC	王韵淮	28ms	432 KiB		282 Bytes	2022-5-20 21:48:46
AC	yucaoluyang22006	28ms	384 KiB		206 Bytes	2023-2-26 11:36:50
AC	ttt123	29ms	384 KiB		271 Bytes	2023-2-26 11:34:58
AC	22029-hqh	29ms	392 KiB		288 Bytes	2023-5-13 12:00:12
AC	ttt123	29ms	512 KiB		281 Bytes	2022-6-30 20:03:41
AC	22016-lyj	29ms	392 KiB		218 Bytes	2023-2-26 11:37:12
AC	黄梓轩 (huangzixuan)	29ms	512 KiB		205 Bytes	2023-5-25 19:30:06
AC	renqiumo	29ms	384 KiB		452 Bytes	2022-4-10 16:03:32
AC	余龙恩---来自额嘛瑞卡 (yulongenshijieshangzuishuai)	29ms	400 KiB		256 Bytes	2022-1-23 10:52:38
AC	王乐仪	29ms	384 KiB		314 Bytes	2022-2-4 15:47:01
AC	甄一阳 (22016-zyy)	29ms	440 KiB		296 Bytes	2023-2-26 11:31:02
AC	王乐仪	29ms	412 KiB		304 Bytes	2022-2-4 15:47:20
AC	17779	29ms	512 KiB		282 Bytes	2022-4-18 14:47:03
AC	何昊宇 (22016-hhy)	29ms	392 KiB		249 Bytes	2023-2-26 11:36:49
AC	杨军方 (lyx2000)	29ms	512 KiB		278 Bytes	2022-2-20 13:20:40
AC	曾御城（现用名） (Jason)	29ms	512 KiB		424 Bytes	2022-7-25 19:44: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)	29ms	392 KiB		316 Bytes	2023-5-13 11:57:26
AC	MoonLight ( aaa)	29ms	452 KiB		300 Bytes	2022-8-10 9:47:41
AC	22029-hqh	29ms	392 KiB		288 Bytes	2023-5-13 11:59:57
AC	陈杰晟	29ms	432 KiB		288 Bytes	2022-3-24 13:45:46
AC	zcx	30ms	384 KiB		227 Bytes	2023-5-13 12:04:02
AC	zhm123	30ms	384 KiB		227 Bytes	2023-5-24 20:22:52
AC	wangruibo20xh	30ms	436 KiB		225 Bytes	2022-3-5 19:23:37
AC	王浚西 (22016-wjx)	30ms	384 KiB		214 Bytes	2023-2-26 11:36:59
AC	zlx (xiao)	30ms	512 KiB		240 Bytes	2022-11-26 19:56:51
AC	王晨志 (wangchenzhi)	30ms	404 KiB		568 Bytes	2022-2-1 1:54:56
AC	赵泳鑫 (zhaoyongxin)	30ms	436 KiB		225 Bytes	2022-7-12 11:37:09
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)	30ms	384 KiB		315 Bytes	2023-5-13 11:53:56
AC	爱琴海校区-刁钲洋 (刁钲洋)	31ms	6.9 MiB		386 Bytes	2023-8-6 11:21:39
AC	RanHao	31ms	8.1 MiB		235 Bytes	2023-8-25 17:02:32
AC	坤坤荔枝小黑子 (zhonghaotian22006)	32ms	384 KiB		288 Bytes	2022-11-26 10:04:17
AC	梅子楠 (22016-mzn)	32ms	6.8 MiB		333 Bytes	2023-6-12 22:12:45
AC	陈骏逸 (chenjunyi)	32ms	7.1 MiB		282 Bytes	2023-7-9 14:24:55
AC	朱老师 (zyp)	32ms	512 KiB		332 Bytes	2022-10-1 19:55:58
AC	曹埊睿 (caodirui)	33ms	384 KiB		265 Bytes	2023-4-17 18:37:06
AC	不怎么聪明的家伙 (贺俊楠)	33ms	6.9 MiB		257 Bytes	2023-7-9 8:41:35
AC	(张洛诚)	33ms	436 KiB		366 Bytes	2023-5-4 20:11:55
AC	爱情海校区—沙天一 (沙天一)	34ms	6.9 MiB		200 Bytes	2023-7-9 8:31:18
AC	新壹街——陈学彬 (BUG)	34ms	6.9 MiB		207 Bytes	2023-7-8 19:12:30
AC	孙烽轶 (sfy)	34ms	7.7 MiB		256 Bytes	2023-8-7 13:28:48
AC	谭红中 (不知道)	35ms	488 KiB		263 Bytes	2023-1-20 12:44:55
AC	关博源	36ms	512 KiB		295 Bytes	2023-4-15 10:55:21
AC	时代一校-赵彦博 (zyb)	38ms	6.9 MiB		267 Bytes	2023-7-30 17:52:40
AC	11111	39ms	512 KiB		254 Bytes	2022-10-2 9:38:57
AC	zhangyh (张育菡)	40ms	512 KiB		227 Bytes	2022-10-2 9:40:13
AC	lizishuo	128ms	764 KiB		221 Bytes	2024-2-21 20:03:17
AC	zyl	139ms	532 KiB		356 Bytes	2024-2-19 11:01:17
AC	张祖名	141ms	764 KiB		242 Bytes	2024-2-23 20:15:57
AC	赵奕铭	142ms	764 KiB		246 Bytes	2024-3-26 13:19:27
AC	无尽的想象 (谭仕高)	149ms	552 KiB		227 Bytes	2024-4-5 16:50:13
AC	Zongzi1	252ms	9.5 MiB	Python 3	132 Bytes	2024-8-7 14:55:56
AC	Corinna	389ms	9.1 MiB	Python 2	137 Bytes	2023-8-15 18:01:30
AC	伍行念 (wuxingnian)	389ms	9.1 MiB	Python 3	216 Bytes	2023-8-15 17:13:13
AC	吃小孩的viv_	392ms	9 MiB	Python 3	243 Bytes	2023-7-21 15:21:27
AC	Marvin	394ms	9 MiB	Python 3	175 Bytes	2023-8-15 17:12:38
AC	伍行念 (wuxingnian)	399ms	9 MiB	Python 3	160 Bytes	2023-7-21 13:29:41
AC	汪致卉 (wangzh)	421ms	4 MiB	Python 3	170 Bytes	2022-4-22 18:31:32
AC	梨冻亿 (wiueh)	425ms	4 MiB	Python 3	174 Bytes	2022-1-23 20:12:36
AC	17383018494	1120ms	3.8 MiB	Python 3	144 Bytes	2024-4-6 11:06:58