判断奇偶数

状态	递交者	时间	内存	语言	代码	递交时间
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	3ms	432 KiB		147 Bytes	2023-2-12 19:58:30
AC	xzf	3ms	6.9 MiB		206 Bytes	2023-8-20 16:49:39
AC	yxj	3ms	384 KiB		155 Bytes	2022-10-20 15:27:51
AC	zzy	3ms	512 KiB		177 Bytes	2023-4-8 16:08:56
AC	时代2校-程俊燃 (chengjunran)	3ms	388 KiB		158 Bytes	2023-4-24 19:59:58
AC	杨在云 (yangzaiyun001)	3ms	384 KiB		145 Bytes	2022-9-3 20:15:00
AC	赵彬鸿	3ms	384 KiB		156 Bytes	2022-1-27 16:09:06
AC	黎湘渝	3ms	388 KiB		175 Bytes	2023-3-14 18:22:03
AC	zhuqiwei22006	3ms	392 KiB		137 Bytes	2022-11-13 11:35:01
AC	李荣轩	3ms	384 KiB		176 Bytes	2023-3-14 18:19:06
AC	炸鱼4000+ (dxc)	3ms	6.8 MiB		176 Bytes	2023-6-24 20:41:11
AC	赵彬鸿	3ms	384 KiB		156 Bytes	2022-1-27 16:09:00
AC	qwertyuiop	3ms	444 KiB		163 Bytes	2022-2-18 20:44:58
AC	AV8D (yumingjie11)	3ms	7 MiB	C++98	151 Bytes	2024-6-15 9:21:14
AC	黄梓桐 (HuangZiTong)	3ms	444 KiB		145 Bytes	2022-9-1 12:33:04
AC	高致远 (GZY)	3ms	440 KiB		168 Bytes	2022-2-19 8:51:45
AC	李荣轩	3ms	384 KiB		176 Bytes	2023-3-14 18:18:57
AC	SHY20091224	3ms	440 KiB		146 Bytes	2022-8-12 11:31:04
AC	时代二校-陈天成 (鸭缩毛巾)	3ms	384 KiB		264 Bytes	2023-2-25 17:17:16
AC	左雨航	3ms	392 KiB		180 Bytes	2023-3-14 18:21:48
AC	新壹街校区--税崇峻 (税崇峻)	3ms	6.9 MiB		144 Bytes	2023-8-16 17:38:48
AC	22029-hqh	3ms	384 KiB		194 Bytes	2023-5-20 10:28:09
AC	真菌晨菇 (hechenxuan23005)	3ms	6.9 MiB	C++98	137 Bytes	2024-6-8 16:36:13
AC	蓝色妖姬 (jiangpeiyu)	3ms	384 KiB		151 Bytes	2022-10-23 13:48:44
AC	戴渝晋	3ms	384 KiB		181 Bytes	2023-3-14 18:25:19
AC	🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕 (bro)	3ms	384 KiB		223 Bytes	2022-1-24 21:36:12
AC	徐宛婷	3ms	392 KiB		186 Bytes	2023-3-14 18:30:12
AC	王泓涵 (whh)	3ms	384 KiB		142 Bytes	2022-7-9 13:36:43
AC	zzzrrrxxx	3ms	6.9 MiB		138 Bytes	2023-7-18 11:21:05
AC	徐宛婷	3ms	384 KiB		186 Bytes	2023-3-14 18:27:20
AC	邹曜丞 (13983097018)	3ms	384 KiB		176 Bytes	2023-5-13 14:37:11
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	3ms	512 KiB		152 Bytes	2022-11-11 16:10:01
AC	wzzjnb2012	3ms	436 KiB		181 Bytes	2022-9-28 13:21:05
AC	左雨航	3ms	512 KiB		180 Bytes	2023-3-14 18:21:47
AC	程舒然	3ms	6.6 MiB	C++11	158 Bytes	2024-7-10 11:18:10
AC	张泰凌 (ztl)	3ms	384 KiB		183 Bytes	2022-1-25 13:59:28
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)	3ms	384 KiB		193 Bytes	2023-5-12 20:22:42
AC	杜是贤 (dushixian)	3ms	400 KiB		144 Bytes	2022-11-26 11:15:46
AC	我推忘归人 (贺俊楠)	3ms	428 KiB		170 Bytes	2023-3-12 8:48:53
AC	黎湘渝	3ms	384 KiB		175 Bytes	2023-3-14 18:30:35
AC	黎湘渝	3ms	384 KiB		175 Bytes	2023-3-14 18:30:26
AC	徐宛婷	3ms	396 KiB		186 Bytes	2023-3-14 18:27:20
AC	王韵淮	3ms	392 KiB		136 Bytes	2022-5-20 21:14:49
AC	黎湘渝	3ms	384 KiB		175 Bytes	2023-3-14 18:23:18
AC	hnd (陈皓洋)	3ms	440 KiB		217 Bytes	2022-8-15 18:50:27
AC	dengduxi	3ms	420 KiB		161 Bytes	2022-11-27 13:24:43
AC	22029-hqh	3ms	384 KiB		194 Bytes	2023-5-20 10:28:09
AC	赵彬鸿	3ms	384 KiB		156 Bytes	2022-1-27 16:09:05
AC	时代二校+王吕棪 (wanglvyan)	3ms	400 KiB		172 Bytes	2023-2-25 17:18:23
AC	UsMt1 (jiangyuan)	3ms	6.8 MiB	C++98	140 Bytes	2024-8-5 12:36:21
AC	戴渝晋	3ms	384 KiB		181 Bytes	2023-3-14 18:25:32
AC	TaLeK (黄子瑞)	3ms	6.9 MiB		149 Bytes	2023-7-28 15:03:24
AC	李荣轩	3ms	384 KiB		176 Bytes	2023-3-14 18:18:57
AC	黎湘渝	3ms	384 KiB		175 Bytes	2023-3-14 18:22:05
AC	wangtan	3ms	384 KiB		174 Bytes	2023-5-9 15:17:17
AC	赵彬鸿	3ms	384 KiB		156 Bytes	2022-1-27 16:09:01
AC	我是周靖松长得帅 (mouyunqi)	3ms	7 MiB		166 Bytes	2023-6-17 15:37:24
AC	张峻熙	3ms	384 KiB		162 Bytes	2022-10-31 20:19:41
AC	左雨航	3ms	392 KiB		180 Bytes	2023-3-14 18:21:47
AC	黎湘渝	3ms	412 KiB		175 Bytes	2023-3-14 18:23:18
AC	戴渝晋	3ms	388 KiB		181 Bytes	2023-3-14 18:25:32
AC	李旻轩	3ms	444 KiB		214 Bytes	2023-4-1 9:08:16
AC	赵彬鸿	3ms	388 KiB		156 Bytes	2022-1-27 16:09:11
AC	李荣轩	3ms	384 KiB		176 Bytes	2023-3-14 18:19:04
AC	李荣轩	3ms	392 KiB		176 Bytes	2023-3-14 18:19:05
AC	杨淇瑞 (杨淇瑞29)	3ms	6.9 MiB		204 Bytes	2023-7-13 12:24:48
AC	刘老师 (图书管理员)	3ms	6.9 MiB		179 Bytes	2023-10-14 17:22:12
AC	黎湘渝	3ms	384 KiB		175 Bytes	2023-3-14 18:30:18
AC	黎湘渝	3ms	392 KiB		175 Bytes	2023-3-14 18:30:26
AC	何定谦 (hdq)	3ms	6.8 MiB		188 Bytes	2023-6-28 12:39:31
AC	李荣轩	3ms	384 KiB		176 Bytes	2023-3-14 18:18:57
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	3ms	400 KiB		162 Bytes	2022-9-4 17:37:58
AC	黎湘渝	3ms	384 KiB		175 Bytes	2023-3-14 18:30:18
AC	xiongxinyao	3ms	424 KiB		233 Bytes	2022-11-17 19:33:08
AC	heyi	3ms	6.8 MiB	C++98(O2)	146 Bytes	2024-8-8 14:46:20
AC	我很6 (zjj22031)	3ms	440 KiB		166 Bytes	2023-3-19 10:45:54
AC	德意志第三帝国 (陈远桥)	3ms	440 KiB		188 Bytes	2022-7-14 14:57:50
AC	李荣轩	3ms	384 KiB		176 Bytes	2023-3-14 18:18:57
AC	李荣轩	3ms	384 KiB		176 Bytes	2023-3-14 18:19:05
AC	三差学生(尘埃蓝莓) (白佳睿)	3ms	7 MiB		176 Bytes	2023-7-7 20:00:38
AC	yuhaodi	3ms	448 KiB		167 Bytes	2023-4-24 18:54:24
AC	yh1	3ms	400 KiB		174 Bytes	2023-3-27 20:54:45
AC	黄梓轩 (huangzixuan)	3ms	6.9 MiB		140 Bytes	2023-7-24 10:51:54
AC	孙烽轶 (sfy)	3ms	6.9 MiB		135 Bytes	2023-8-7 13:13:38
AC	时代二校+王吕棪 (wanglvyan)	3ms	440 KiB		188 Bytes	2023-2-25 17:06:21
AC	欧俊阳	3ms	6.9 MiB		131 Bytes	2023-7-24 20:11:53
AC	李龙腾 (llt)	3ms	7.3 MiB		167 Bytes	2023-6-29 20:46:42
AC	黎湘渝	3ms	384 KiB		175 Bytes	2023-3-14 18:30:19
AC	龚铭俊 (哈哈哈)	3ms	6.9 MiB		151 Bytes	2023-7-23 10:50:34
AC	美术猫映画 (mkh)	3ms	392 KiB		119 Bytes	2023-3-27 20:26:02
AC	李荣轩	3ms	392 KiB		176 Bytes	2023-3-14 18:18:57
AC	ycy	3ms	6.9 MiB		165 Bytes	2023-7-2 9:15:01
AC	赵彬鸿	3ms	384 KiB		156 Bytes	2022-1-27 16:09:10
AC	林子沫awa (linziyue)	3ms	436 KiB		195 Bytes	2023-3-16 22:37:52
AC	关博源	3ms	444 KiB		159 Bytes	2023-3-5 15:36:12
AC	秦兴润	3ms	6.8 MiB		184 Bytes	2023-6-8 19:17:07
AC	司雨来 (siyulai)	3ms	384 KiB		181 Bytes	2022-10-6 16:41:00
AC	22029-hqh	3ms	384 KiB		194 Bytes	2023-5-20 10:28:09
AC	Error404sans (焦阳浩云)	3ms	384 KiB		157 Bytes	2023-1-16 13:39:36
AC	伍芷函	3ms	544 KiB		175 Bytes	2022-9-6 19:01:10