计算成绩优秀的人数

状态	递交者	时间	内存	代码	递交时间
AC	廖永亨	14ms	512 KiB	214 Bytes	2022-12-7 18:16:28
AC	暗蛆突围 (lzh)	14ms	404 KiB	236 Bytes	2022-9-9 19:23:07
AC	暗蛆突围 (lzh)	14ms	384 KiB	236 Bytes	2022-9-9 19:24:13
AC	叶哲宇 (yzy)	14ms	6.7 MiB	182 Bytes	2023-9-3 17:34:58
AC	暗蛆突围 (lzh)	14ms	392 KiB	236 Bytes	2022-9-9 19:23:07
AC	暗蛆突围 (lzh)	14ms	384 KiB	236 Bytes	2022-9-9 19:23:09
AC	暗蛆突围 (lzh)	14ms	384 KiB	236 Bytes	2022-9-9 19:22:46
AC	姚宏逸	15ms	384 KiB	254 Bytes	2022-10-17 19:46:26
AC	暗蛆突围 (lzh)	15ms	384 KiB	236 Bytes	2022-9-9 19:22:39
AC	暗蛆突围 (lzh)	15ms	384 KiB	236 Bytes	2022-9-9 19:23:15
AC	暗蛆突围 (lzh)	15ms	424 KiB	236 Bytes	2022-9-9 19:22:45
AC	暗蛆突围 (lzh)	15ms	392 KiB	236 Bytes	2022-9-9 19:22:45
AC	zhangjiani	15ms	384 KiB	201 Bytes	2022-9-13 19:39:53
AC	金锦泽 (jinjinze)	15ms	384 KiB	178 Bytes	2023-3-8 19:19:25
AC	陈雨泽1	15ms	428 KiB	220 Bytes	2023-2-1 18:57:26
AC	暗蛆突围 (lzh)	15ms	512 KiB	236 Bytes	2022-9-9 19:23:09
AC	暗蛆突围 (lzh)	15ms	392 KiB	236 Bytes	2022-9-9 19:23:06
AC	chenjunyao	15ms	6.7 MiB	277 Bytes	2023-9-2 23:31:46
AC	暗蛆突围 (lzh)	15ms	384 KiB	236 Bytes	2022-9-9 19:24:14
AC	暗蛆突围 (lzh)	15ms	384 KiB	236 Bytes	2022-9-9 19:23:08
AC	colin1112 (墙凌可)	15ms	512 KiB	221 Bytes	2022-9-9 18:43:55
AC	暗蛆突围 (lzh)	15ms	384 KiB	236 Bytes	2022-9-9 19:24:11
AC	新壹街校区--税崇峻 (税崇峻)	15ms	6.8 MiB	196 Bytes	2023-10-2 9:38:14
AC	唐良瑞 (22016-tlr01)	15ms	440 KiB	199 Bytes	2022-11-27 16:05:48
AC	暗蛆突围 (lzh)	15ms	392 KiB	236 Bytes	2022-9-9 19:22:45
AC	无尽的想象 (谭仕高)	15ms	508 KiB	180 Bytes	2023-3-10 14:29:02
AC	暗蛆突围 (lzh)	15ms	392 KiB	236 Bytes	2022-9-9 19:22:40
AC	谭懿轩 (yanyixuan)	15ms	440 KiB	156 Bytes	2022-10-17 13:49:56
AC	暗蛆突围 (lzh)	15ms	384 KiB	236 Bytes	2022-9-9 19:24:11
AC	暗蛆突围 (lzh)	15ms	384 KiB	236 Bytes	2022-9-9 19:23:18
AC	暗蛆突围 (lzh)	15ms	392 KiB	236 Bytes	2022-9-9 19:22:40
AC	暗蛆突围 (lzh)	15ms	384 KiB	236 Bytes	2022-9-9 19:23:17
AC	王胤钦 (wangyinqin)	15ms	384 KiB	178 Bytes	2022-9-9 20:06:29
AC	霍弈丞小号	15ms	392 KiB	203 Bytes	2022-8-26 11:13:38
AC	11111	15ms	428 KiB	193 Bytes	2022-10-27 16:58:41
AC	曾龙兮	15ms	384 KiB	190 Bytes	2022-9-7 20:11:34
AC	暗蛆突围 (lzh)	15ms	384 KiB	236 Bytes	2022-9-9 19:24:11
AC	胡宸华 (huchenhua)	15ms	6.9 MiB	429 Bytes	2023-8-15 22:19:53
AC	暗蛆突围 (lzh)	15ms	384 KiB	236 Bytes	2022-9-9 19:22:43
AC	暗蛆突围 (lzh)	15ms	384 KiB	236 Bytes	2022-9-9 19:23:06
AC	暗蛆突围 (lzh)	15ms	428 KiB	236 Bytes	2022-9-9 19:23:10
AC	郑尧 (zhengyao)	15ms	440 KiB	204 Bytes	2023-3-14 20:05:45
AC	1396013295	15ms	440 KiB	210 Bytes	2022-10-23 10:38:55
AC	爱琴海校区-刁钲洋 (刁钲洋)	15ms	6.9 MiB	318 Bytes	2023-7-26 19:36:53
AC	暗蛆突围 (lzh)	15ms	404 KiB	236 Bytes	2022-9-9 19:22:44
AC	陈泰羽 (chentaiyu)	15ms	392 KiB	196 Bytes	2023-3-15 18:56:42
AC	暗蛆突围 (lzh)	15ms	384 KiB	236 Bytes	2022-9-9 19:22:40
AC	明轩 (吕同学)	15ms	524 KiB	274 Bytes	2022-9-9 19:01:39
AC	暗蛆突围 (lzh)	15ms	392 KiB	236 Bytes	2022-9-9 19:24:19
AC	刘老师 (图书管理员)	15ms	392 KiB	199 Bytes	2022-8-26 10:04:38
AC	李禹衡 (liyuheng22006)	15ms	416 KiB	216 Bytes	2022-11-17 16:36:14
AC	xuniaoyin (徐袅音)	15ms	6.9 MiB	259 Bytes	2023-8-4 12:13:26
AC	暗蛆突围 (lzh)	15ms	384 KiB	236 Bytes	2022-9-9 19:22:50
AC	王彬羽 (wby)	15ms	428 KiB	254 Bytes	2023-3-12 16:21: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	6.8 MiB	200 Bytes	2023-6-11 10:35:09
AC	暗蛆突围 (lzh)	15ms	384 KiB	236 Bytes	2022-9-9 19:23:14
AC	暗蛆突围 (lzh)	15ms	392 KiB	236 Bytes	2022-9-9 19:23:11
AC	暗蛆突围 (lzh)	15ms	384 KiB	236 Bytes	2022-9-9 19:22:51
AC	暗蛆突围 (lzh)	15ms	400 KiB	236 Bytes	2022-9-9 19:24:17
AC	纪承熙 (jcx001)	15ms	7 MiB	206 Bytes	2023-7-11 11:50:53
AC	ttt123	16ms	512 KiB	223 Bytes	2022-11-20 19:50:37
AC	暗蛆突围 (lzh)	16ms	396 KiB	236 Bytes	2022-9-9 19:22:51
AC	廖永亨	16ms	432 KiB	217 Bytes	2022-12-7 18:09:45
AC	黄梓桐 (HuangZiTong)	16ms	436 KiB	199 Bytes	2022-11-13 11:28:15
AC	暗蛆突围 (lzh)	16ms	384 KiB	236 Bytes	2022-9-9 19:23:18
AC	wangshuo	16ms	436 KiB	192 Bytes	2022-9-16 19:43:32
AC	时代一校-赵彦博 (zyb)	16ms	6.9 MiB	181 Bytes	2023-8-8 13:55:58
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	16ms	440 KiB	215 Bytes	2022-12-14 8:57:16
AC	时代一校 - 冯隆浩 (冯隆浩)	16ms	436 KiB	188 Bytes	2023-4-18 15:09:13
AC	暗蛆突围 (lzh)	16ms	384 KiB	236 Bytes	2022-9-9 19:22:51
AC	暗蛆突围 (lzh)	16ms	392 KiB	236 Bytes	2022-9-9 19:22:42
AC	疯神芭芭脱丝 (李卓修)	16ms	512 KiB	264 Bytes	2022-10-10 17:49:37
AC	RanHao	16ms	8.2 MiB	168 Bytes	2023-8-24 13:51:46
AC	坤坤荔枝小黑子 (zhonghaotian22006)	16ms	436 KiB	241 Bytes	2022-10-12 18:27:58
AC	李树崑 (lishukun)	17ms	436 KiB	289 Bytes	2022-10-22 15:03:00
AC	wuqilin	17ms	396 KiB	170 Bytes	2022-9-7 20:07:02
AC	暗蛆突围 (lzh)	17ms	384 KiB	236 Bytes	2022-9-9 19:23:17
AC	李卓燃 (李卓燃1)	17ms	436 KiB	179 Bytes	2023-3-17 17:34:08
AC	杜俊宏	17ms	432 KiB	227 Bytes	2023-1-14 10:47:42
AC	暗蛆突围 (lzh)	17ms	384 KiB	236 Bytes	2022-9-9 19:22:42
AC	Randy Marsh (杨子腾)	17ms	444 KiB	258 Bytes	2023-1-11 13:53:20
AC	刘老师 (图书管理员)	17ms	384 KiB	199 Bytes	2022-8-26 10:06:27
AC	暗蛆突围 (lzh)	17ms	384 KiB	236 Bytes	2022-9-9 19:23:08
AC	姚宏逸	18ms	512 KiB	254 Bytes	2022-10-19 14:53:23
AC	王祎辰 (wangyichen)	19ms	392 KiB	246 Bytes	2023-3-8 19:19:04
AC	huyinuo	19ms	448 KiB	219 Bytes	2022-10-10 11:08:30
AC	王晨志 (wangchenzhi)	19ms	432 KiB	426 Bytes	2022-10-9 16:49:33
AC	希蒙 (zhengxingya)	64ms	536 KiB	352 Bytes	2024-3-9 11:44:28
AC	zyl	68ms	764 KiB	427 Bytes	2024-1-25 14:54:59