成年人判断1

状态	递交者	时间	内存	语言	代码	递交时间
AC	wuqi	12ms	512 KiB		182 Bytes	2022-1-22 11:45:18
AC	huyunyi23003	12ms	420 KiB		152 Bytes	2023-2-18 16:06:59
AC	lijinyu23003	12ms	384 KiB		151 Bytes	2023-2-18 16:06:51
AC	李晨希	12ms	384 KiB		120 Bytes	2023-3-4 9:40:11
AC	limz	12ms	7.2 MiB	C++11	141 Bytes	2024-4-21 10:02:42
AC	王宇桐 (我是外挂)	12ms	384 KiB		173 Bytes	2022-2-19 11:57:15
AC	霍弈丞	12ms	384 KiB		134 Bytes	2022-2-27 11:45:36
AC	yangyutong22003	12ms	384 KiB		152 Bytes	2023-2-18 16:06:54
AC	谭懿轩 (yanyixuan)	12ms	436 KiB		121 Bytes	2022-2-15 13:37:48
AC	草\|\|草 (陈星佑)	12ms	512 KiB		138 Bytes	2022-4-9 11:45:08
AC	张峻尘 (zjc)	12ms	512 KiB		120 Bytes	2022-3-27 10:30:11
AC	liuyuchen	12ms	384 KiB		125 Bytes	2023-2-19 15:09:35
AC	xiangsiyu	12ms	384 KiB		150 Bytes	2022-6-21 21:49:20
AC	Jack	12ms	384 KiB		129 Bytes	2022-8-2 17:20:15
AC	李某人	12ms	384 KiB		142 Bytes	2022-1-26 11:26:52
AC	panyan	12ms	384 KiB		107 Bytes	2022-4-30 13:59:20
AC	重庆新壹街-钟政鑫 (钟政鑫)	12ms	6.8 MiB		112 Bytes	2023-10-9 19:29:06
AC	新壹街校区-周士杰 (zsj)	12ms	392 KiB		124 Bytes	2022-3-4 19:59:05
AC	炸鱼4000+ (dxc)	12ms	6.7 MiB		133 Bytes	2023-9-6 19:33:35
AC	黄立信	12ms	6.8 MiB		121 Bytes	2023-10-12 20:09:56
AC	龙吉先 (ljx)	12ms	384 KiB		122 Bytes	2023-2-18 11:15:06
AC	22029-hqh	12ms	384 KiB		146 Bytes	2023-5-20 11:00:05
AC	dengduxi	12ms	392 KiB		127 Bytes	2022-11-27 13:28:24
AC	zhaohaotong	12ms	492 KiB		144 Bytes	2022-7-28 11:24:53
AC	cheers 戴 (daizhuorun)	12ms	392 KiB		150 Bytes	2022-4-17 13:13:01
AC	李玥漪	12ms	384 KiB		139 Bytes	2022-2-27 10:52:20
AC	xxteacher	12ms	392 KiB		242 Bytes	2022-1-28 12:23:46
AC	11451254188 (22029-mjh)	12ms	432 KiB		131 Bytes	2022-11-15 13:45:32
AC	刘入源	12ms	416 KiB		109 Bytes	2022-7-1 20:49:52
AC	六 (江智昕)	12ms	384 KiB		135 Bytes	2022-12-29 16:58:57
AC	王胤钦 (wangyinqin)	12ms	384 KiB		115 Bytes	2022-4-30 16:16:20
AC	赵彬鸿	12ms	384 KiB		121 Bytes	2022-1-27 15:43:50
AC	在煎鱼的肖大总铳 (肖宇航)	12ms	6.8 MiB		129 Bytes	2023-9-24 10:56:19
AC	wuqi	12ms	392 KiB		182 Bytes	2022-1-22 11:45:21
AC	杨睎尧	12ms	384 KiB		143 Bytes	2022-1-26 15:41:51
AC	赵彬鸿	12ms	384 KiB		121 Bytes	2022-1-27 15:43:50
AC	赵泳鑫 (zhaoyongxin)	12ms	512 KiB		186 Bytes	2022-3-12 18:42:04
AC	曹雅萱	12ms	7 MiB	C++11	144 Bytes	2024-8-24 14:13:47
AC	yuchenyi23017	12ms	6.7 MiB		130 Bytes	2023-9-17 19:14:58
AC	dinghaoyan1	12ms	392 KiB		123 Bytes	2022-9-12 15:55:48
AC	谢博文	12ms	388 KiB		177 Bytes	2022-2-19 9:14:41
AC	我是傻逼 (刘鸿瑞)	12ms	6.9 MiB	C++11	126 Bytes	2024-8-24 10:43:19
AC	Cristiano·Ronaldo (05c41-gmz)	12ms	440 KiB		122 Bytes	2022-7-27 13:36:49
AC	汪子铭	12ms	384 KiB		157 Bytes	2022-2-27 11:14:55
AC	hjh	12ms	432 KiB		105 Bytes	2023-5-12 19:26:09
AC	王星皓	12ms	512 KiB		138 Bytes	2022-2-27 11:11:29
AC	wuqi	12ms	384 KiB		182 Bytes	2022-1-22 11:45:00
AC	yiqiuyu	12ms	412 KiB		139 Bytes	2023-2-18 16:08:06
AC	tad (OP AI)	12ms	7 MiB	C++98	119 Bytes	2024-6-16 15:38:21
AC	谢靳骁 (XJX)	12ms	384 KiB		133 Bytes	2023-3-19 18:20:44
AC	国林泽 (guolinze)	12ms	384 KiB		124 Bytes	2022-5-2 19:36:38
AC	dinghaoyan1	12ms	392 KiB		123 Bytes	2022-9-12 15:55:48
AC	(张洛诚)	12ms	512 KiB		150 Bytes	2023-4-2 10:30:41
AC	经常消失 (小萝卜)	12ms	384 KiB		156 Bytes	2022-1-24 15:25:15
AC	拥抱幸福小熊(吴沛篪)	12ms	6.8 MiB		120 Bytes	2023-10-28 9:30:01
AC	李旻轩	12ms	384 KiB		171 Bytes	2023-2-11 11:12:12
AC	dinghaoyan1	12ms	384 KiB		123 Bytes	2022-9-12 15:55:47
AC	铁牛杰哥官方频道	12ms	384 KiB		139 Bytes	2022-3-9 20:23:12
AC	22029-hqh	12ms	384 KiB		146 Bytes	2023-5-20 11:00:05
AC	Accepted (周芷乐)	12ms	7 MiB	C++14	151 Bytes	2024-6-17 21:31:52
AC	Tang	12ms	384 KiB		158 Bytes	2022-2-19 9:18:47
AC	田开蕊	12ms	6.8 MiB		153 Bytes	2023-10-28 9:27:56
AC	你爹 (郭铠嘉)	12ms	392 KiB		142 Bytes	2022-1-26 18:38:48
AC	huangjuner23003	12ms	384 KiB		166 Bytes	2023-2-18 16:12:57
AC	蒋丁非凡	12ms	432 KiB		161 Bytes	2023-5-11 18:07:09
AC	冯若涵	12ms	6.8 MiB		141 Bytes	2023-10-28 9:31:03
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	12ms	432 KiB		133 Bytes	2022-7-21 14:12:08
AC	杜俊宏	12ms	512 KiB		121 Bytes	2022-3-21 19:59:19
AC	神秘人 (张涵曦大帅哥)	12ms	512 KiB		123 Bytes	2022-4-9 20:55:15
AC	罗伟杰 (13308275065)	12ms	432 KiB		139 Bytes	2022-7-19 8:41:16
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)	12ms	436 KiB		130 Bytes	2022-9-24 15:43:12
AC	时代一校-赵彦博 (zyb)	12ms	512 KiB		157 Bytes	2022-9-18 11:13:08
AC	邬文博 (wwb)	12ms	392 KiB		114 Bytes	2023-5-15 20:56:57
AC	吵吵小小 (超级小白)	12ms	392 KiB		133 Bytes	2023-2-19 15:17:28
AC	dinghaoyan1	12ms	392 KiB		123 Bytes	2022-9-12 15:55:47
AC	吵吵小小 (超级小白)	12ms	384 KiB		133 Bytes	2023-2-19 15:17:27
AC	22029-hqh	12ms	392 KiB		146 Bytes	2023-5-20 11:00:04
AC	我全家SB！！！我没母！！！ (baijinlin)	12ms	392 KiB		157 Bytes	2023-2-18 16:07:55
AC	dinghaoyan1	12ms	512 KiB		123 Bytes	2022-9-12 15:55:46
AC	heyi	12ms	6.8 MiB	C++98(O2)	124 Bytes	2024-8-8 13:21:55
AC	sqmyb	12ms	432 KiB		118 Bytes	2022-11-7 21:28:48
AC	傅博涛	12ms	384 KiB		158 Bytes	2022-1-22 10:42:47
AC	SMIK	12ms	420 KiB		164 Bytes	2022-1-24 12:41:24
AC	六 (江智昕)	12ms	384 KiB		135 Bytes	2022-12-29 16:58:50
AC	六 (江智昕)	12ms	384 KiB		135 Bytes	2022-12-29 16:58:44
AC	唐彬献	12ms	7.1 MiB		150 Bytes	2023-10-28 9:40:49
AC	六 (江智昕)	12ms	384 KiB		135 Bytes	2022-12-29 16:58:47
AC	soha (武夷岩)	12ms	384 KiB		133 Bytes	2022-6-25 17:30:43
AC	huangjuner23003	12ms	512 KiB		166 Bytes	2023-2-18 16:21:20
AC	陈子欧	12ms	396 KiB		114 Bytes	2023-2-19 15:11:29
AC	源著校区陈锐霖 (13983855850)	12ms	6.8 MiB	C++11	124 Bytes	2024-8-13 13:05:46
AC	hulang	12ms	384 KiB		150 Bytes	2022-5-8 16:22:09
AC	huyinuo	12ms	416 KiB		125 Bytes	2022-2-20 12:06:26
AC	22029-hqh	12ms	384 KiB		146 Bytes	2023-5-20 11:00:04
AC	冯晨旭	12ms	6.8 MiB		171 Bytes	2023-10-28 9:33:10
AC	dinghaoyan1	12ms	392 KiB		123 Bytes	2022-9-12 15:55:46
AC	ymh	12ms	384 KiB		116 Bytes	2022-4-21 16:45:14
AC	dengfeng	12ms	512 KiB		117 Bytes	2022-7-23 18:50:51
AC	赵鑫宸 (xiaoxiao721)	12ms	440 KiB		208 Bytes	2022-2-20 5:16:33
AC	zhangxinchen	12ms	384 KiB		134 Bytes	2022-4-5 14:04:27