求平均数

状态	递交者	时间	内存	语言	代码	递交时间
AC	牟淳雅	4ms	6.9 MiB		262 Bytes	2023-7-26 13:38:54
AC	邹曜丞 (13983097018)	4ms	7.2 MiB	C++11	479 Bytes	2024-4-20 13:40:31
AC	zcx	4ms	428 KiB		193 Bytes	2022-11-16 15:51:31
AC	新壹街罗田雨 (罗田雨29)	4ms	7.2 MiB		207 Bytes	2023-12-8 21:33:05
AC	一个小黑	4ms	7.1 MiB		175 Bytes	2024-1-13 18:39:40
AC	叶哲宇 (yzy)	4ms	6.7 MiB		229 Bytes	2023-8-22 17:41:35
AC	zzl	4ms	6.8 MiB		295 Bytes	2023-11-7 0:29:58
AC	纪承熙 (jcx001)	4ms	6.9 MiB		207 Bytes	2023-7-17 10:18:24
AC	maobohan	4ms	384 KiB		207 Bytes	2023-5-13 9:56:00
AC	Erin	4ms	7.1 MiB	C++98	197 Bytes	2024-5-3 16:05:04
AC	余彦瑞	4ms	392 KiB		282 Bytes	2023-4-9 12:07:19
AC	wuqilin	4ms	444 KiB		194 Bytes	2023-2-5 15:15:39
AC	邬文博 (wwb)	4ms	384 KiB		182 Bytes	2023-4-16 12:17:06
AC	阮 (媚狐不吃道旁李)	4ms	7.2 MiB	C++98	186 Bytes	2024-5-18 20:54:56
AC	张月恒	4ms	7 MiB	C++98(O2)	180 Bytes	2024-5-26 18:42:54
AC	hnd (陈皓洋)	4ms	384 KiB		170 Bytes	2022-11-16 21:22:56
AC	时代二校-陈天成 (鸭缩毛巾)	4ms	412 KiB		187 Bytes	2023-4-15 22:25:14
AC	22029-lsl	4ms	436 KiB		252 Bytes	2022-11-19 10:44:14
AC	在煎鱼的肖大总铳 (肖宇航)	4ms	6.8 MiB		201 Bytes	2023-9-24 11:16:02
AC	cupy战士 (05c05-dkf)	4ms	6.9 MiB		239 Bytes	2023-9-24 11:38:08
AC	秦圣恩	4ms	7.2 MiB	C++98	212 Bytes	2024-5-17 17:09:05
AC	周靖淞 (zhoujingsong)	4ms	7 MiB		219 Bytes	2023-12-31 17:31:40
AC	新壹街校区-郭老师-陈品烨 (陈品烨)	4ms	6.8 MiB		180 Bytes	2023-10-2 14:10:47
AC	wangjun	4ms	6.6 MiB		203 Bytes	2023-11-22 13:52:49
AC	时代一校-曾科智 (曾科智)	4ms	440 KiB		237 Bytes	2023-2-27 20:33:12
AC	缥 (王硕2012)	4ms	392 KiB		271 Bytes	2022-11-28 21:47:52
AC	Accepted (周芷乐)	4ms	6.9 MiB	C++14	253 Bytes	2024-6-20 18:23:42
AC	李林峰 (金克拉)	4ms	428 KiB		195 Bytes	2023-2-18 9:46:00
AC	杨淇瑞 (杨淇瑞29)	4ms	7 MiB		235 Bytes	2023-7-18 19:50:22
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)	4ms	384 KiB		239 Bytes	2022-11-13 16:37:54
AC	Turorany (郑浩然)	4ms	7.1 MiB		247 Bytes	2023-12-1 19:29:56
AC	新壹街校区-周士杰 (zsj)	4ms	6.7 MiB		182 Bytes	2023-8-28 9:15:30
AC	韦孟巡_1	4ms	436 KiB		298 Bytes	2023-4-9 17:24:30
AC	江坤锜	4ms	384 KiB		225 Bytes	2023-4-1 20:15:41
AC	殷语函	4ms	6.9 MiB	C++11	199 Bytes	2024-8-23 21:37:30
AC	傀儡师 (zhujingen)	4ms	7.2 MiB	C++11	186 Bytes	2024-4-25 16:49:05
AC	向俊熙 (xiangjunxi23003)	4ms	6.9 MiB		209 Bytes	2023-8-6 15:25:12
AC	lby_joey	4ms	6.6 MiB	C++17(O2)	202 Bytes	2024-7-17 15:52:48
AC	(张洛诚)	4ms	452 KiB		254 Bytes	2023-4-14 16:03:52
AC	三差学生 (尘埃蓝莓)	4ms	6.9 MiB		168 Bytes	2023-10-28 18:52:24
AC	时代二校-焦雨齐 (Angel)	4ms	412 KiB		178 Bytes	2023-4-16 13:53:25
AC	zhangyouze (张佑泽)	4ms	6.8 MiB		256 Bytes	2023-10-31 19:55:58
AC	赵启程 (赵启程1)	4ms	384 KiB		176 Bytes	2023-4-1 20:14:50
AC	余瀚	4ms	6.9 MiB	C++11	176 Bytes	2024-8-22 17:10:54
AC	miku (阳沐珊)	4ms	384 KiB		196 Bytes	2023-4-1 20:04:11
AC	胡程禹	4ms	384 KiB		199 Bytes	2023-4-1 20:31:39
AC	杨瀚霖 (yanghanlin)	4ms	512 KiB		196 Bytes	2023-3-27 22:23:09
AC	laiyouming22031	4ms	384 KiB		165 Bytes	2022-11-27 11:58:40
AC	我推的乱破 (贺俊楠)	4ms	6.8 MiB		229 Bytes	2023-11-5 9:04:52
AC	我很6 (zjj22031)	4ms	384 KiB		219 Bytes	2022-12-2 15:23:37
AC	一个小黑	4ms	6.8 MiB		179 Bytes	2023-10-30 10:51:03
AC	欧俊阳	4ms	6.9 MiB		223 Bytes	2023-7-26 20:55:39
AC	王锦锐 (wjr)	4ms	6.9 MiB		230 Bytes	2024-1-3 18:39:47
AC	乐瀚阳 (yuehanyang)	4ms	436 KiB		211 Bytes	2023-3-18 15:37:18
AC	游智棋	4ms	7 MiB	C++17	224 Bytes	2024-6-17 20:38:52
AC	miku (阳沐珊)	4ms	444 KiB		196 Bytes	2023-3-23 18:01:10
AC	苏庭毅	4ms	384 KiB		197 Bytes	2023-4-1 20:18:06
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	4ms	384 KiB		199 Bytes	2022-12-10 11:41:45
AC	时代1校-杨宇轩 (杨宇轩)	4ms	440 KiB		197 Bytes	2023-4-1 9:31:25
AC	源著校区-宋昊成 (马冬梅)	4ms	436 KiB		283 Bytes	2023-2-25 18:13:43
AC	时代校区-刘臣原 (微笑王子)	4ms	384 KiB		187 Bytes	2022-12-28 21:06:15
AC	我很6 (zjj22031)	4ms	432 KiB		219 Bytes	2022-12-2 15:23:31
AC	陈廷恩	4ms	6.8 MiB		188 Bytes	2023-10-13 20:48:27
AC	xuniaoyin (徐袅音)	4ms	6.9 MiB		239 Bytes	2023-9-10 10:36:33
AC	强愉堃 (强愉堃1)	4ms	384 KiB		157 Bytes	2023-4-1 20:13:33
AC	靳博然 (jbr)	4ms	412 KiB		208 Bytes	2023-3-19 18:36:33
AC	Guest	4ms	6.8 MiB		193 Bytes	2023-9-24 15:18:43
AC	zvt_132 (任子轩)	4ms	6.9 MiB		211 Bytes	2023-7-17 12:18:18
AC	罗莎莎	4ms	384 KiB		247 Bytes	2023-4-2 19:39:48
AC	崔欧辰	4ms	6.9 MiB	C++11	287 Bytes	2024-8-16 8:43:44
AC	zzy	4ms	404 KiB		230 Bytes	2023-4-8 16:11:43
AC	ycy	4ms	384 KiB		178 Bytes	2022-11-18 17:16:14
AC	xzf	4ms	6.7 MiB		295 Bytes	2023-9-24 15:27:42
AC	liujingxing(我要李毛川!) (liujingxing)	4ms	6.7 MiB		209 Bytes	2023-9-17 16:06:33
AC	AC[谭赫奕] (tanheyi)	4ms	384 KiB		207 Bytes	2023-4-1 11:26:40
AC	22029-hqh	4ms	436 KiB		215 Bytes	2022-11-19 11:36:53
AC	胡澜之 (666hlz666)	4ms	440 KiB		208 Bytes	2023-4-25 19:48:41
AC	heyuzhe	4ms	6.9 MiB	C++98	199 Bytes	2024-8-16 8:36:21
AC	陈家齐 (陈家齐1)	4ms	392 KiB		161 Bytes	2023-4-1 20:11:14
AC	Nico	4ms	392 KiB		183 Bytes	2023-4-16 14:40:40
AC	ycy	4ms	384 KiB		235 Bytes	2022-6-29 14:03:18
AC	22029-zjs	4ms	384 KiB		233 Bytes	2022-11-19 11:05:37
AC	zzy	4ms	384 KiB		230 Bytes	2023-4-8 16:11:46
AC	邵冠铖 (shaoguancheng22031)	4ms	432 KiB		184 Bytes	2022-11-28 19:51:00
AC	Noah (mwx)	4ms	7.2 MiB	C++98	194 Bytes	2024-5-6 19:16:44
AC	李睿杰	4ms	392 KiB		178 Bytes	2023-1-7 11:38:00
AC	蒲梓勋 (puzixun)	4ms	512 KiB		212 Bytes	2022-11-29 22:22:36
AC	一片落叶 (yeyuhao)	4ms	6.7 MiB		279 Bytes	2023-8-28 20:22:03
AC	老六（王牌） (mhc)	4ms	440 KiB		240 Bytes	2023-3-26 13:07:15
AC	霍弈丞小号	4ms	448 KiB		245 Bytes	2023-4-9 12:05:37
AC	星野光 (Hoshino Hikari)	4ms	6.8 MiB		331 Bytes	2023-10-23 19:07:12
AC	靳博然 (jbr)	4ms	384 KiB		210 Bytes	2023-3-19 18:37:07
AC	10255	4ms	440 KiB		199 Bytes	2023-3-3 18:55:36
AC	56 (13883454928)	4ms	6.7 MiB		220 Bytes	2023-8-28 9:41:53
AC	wuqi	4ms	6.9 MiB		259 Bytes	2023-7-23 13:56:59
AC	李卓燃 (李卓燃1)	4ms	6.9 MiB		194 Bytes	2023-8-5 9:22:07
AC	爱情海校区—沙天一 (沙天一)	4ms	384 KiB		210 Bytes	2023-3-11 11:12:33
AC	张承暄	4ms	7.1 MiB		175 Bytes	2023-7-4 10:49:08
AC	贾博涵	4ms	6.8 MiB		190 Bytes	2023-11-8 11:53:44
AC	爱琴海校区jzn (jzn)	4ms	384 KiB		198 Bytes	2023-3-11 11:11:10