判断数字的奇偶

状态	递交者	时间	内存	代码	递交时间
AC	谭懿轩 (yanyixuan)	14ms	436 KiB	139 Bytes	2022-3-17 17:41:47
AC	魏楚浔 (shawn)	14ms	436 KiB	176 Bytes	2022-2-27 18:15:25
AC	TBB (杜昊燃)	14ms	520 KiB	160 Bytes	2022-3-22 8:58:20
AC	可爱的小花狗	14ms	440 KiB	162 Bytes	2023-2-26 20:44:21
AC	杜是贤 (dushixian)	14ms	436 KiB	147 Bytes	2022-3-9 20:14:35
AC	Steven (王梓丞)	14ms	440 KiB	193 Bytes	2022-4-16 14:05:42
AC	赵彬鸿	14ms	388 KiB	138 Bytes	2022-8-12 15:28:48
AC	11451254188 (22029-mjh)	14ms	384 KiB	156 Bytes	2022-11-13 11:08:01
AC	zhr	14ms	512 KiB	177 Bytes	2023-4-16 17:23:50
AC	老六（王牌） (mhc)	14ms	384 KiB	186 Bytes	2023-5-13 9:18:39
AC	杨淇瑞 (杨淇瑞29)	14ms	448 KiB	196 Bytes	2023-4-23 20:22:39
AC	新壹街校区-陈品烨 (陈品烨)	14ms	6.7 MiB	174 Bytes	2023-10-1 10:37:10
AC	吵吵小小 (超级小白)	14ms	6.8 MiB	153 Bytes	2023-11-5 13:17:00
AC	游智棋	14ms	6.9 MiB	172 Bytes	2023-8-13 12:39:32
AC	暗蛆突围 (lzh)	14ms	6.8 MiB	182 Bytes	2023-10-29 0:09:49
AC	谭懿轩 (yanyixuan)	14ms	444 KiB	156 Bytes	2022-2-14 21:36:45
AC	lll	14ms	384 KiB	143 Bytes	2022-10-6 14:34:49
AC	新壹街校区-陈峻熙 (陈峻熙)	14ms	7 MiB	176 Bytes	2023-10-28 11:33:12
AC	南坪校区-淡昌盛 (Dancs)	14ms	432 KiB	169 Bytes	2023-2-18 11:37:54
AC	吵吵小小 (超级小白)	14ms	6.8 MiB	153 Bytes	2023-11-5 13:15:10
AC	孙天豪 (AliceSteven)	14ms	444 KiB	146 Bytes	2022-7-30 16:55:42
AC	lafuzbc	14ms	512 KiB	162 Bytes	2022-7-24 16:11:49
AC	六 (江智昕)	14ms	384 KiB	177 Bytes	2022-12-29 16:51:10
AC	时代一校-曾科智 (曾科智)	14ms	444 KiB	204 Bytes	2022-9-4 8:06:02
AC	南坪校区-郑力博 (zhenglibo23003)	14ms	436 KiB	163 Bytes	2023-2-18 16:41:16
AC	U城校区-郭旻哲 (郭旻哲)	14ms	6.7 MiB	176 Bytes	2023-9-3 21:10:25
AC	江坤锜	14ms	436 KiB	179 Bytes	2023-2-11 19:38:53
AC	叶令子	14ms	6.8 MiB	172 Bytes	2023-11-6 20:23:33
AC	Mzy	14ms	6.7 MiB	150 Bytes	2023-9-23 20:35:39
AC	余晨浩 (yuchenhao)	14ms	7 MiB	144 Bytes	2023-8-31 14:51:39
AC	褚博艺	14ms	7.3 MiB	169 Bytes	2023-10-5 14:56:17
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)	14ms	440 KiB	183 Bytes	2022-9-24 15:29:06
AC	赵彬鸿	14ms	392 KiB	138 Bytes	2022-8-12 15:28:47
AC	huyunyi23003	14ms	416 KiB	146 Bytes	2023-2-18 17:36:51
AC	zzl	14ms	6.8 MiB	185 Bytes	2023-11-6 20:56:49
AC	吴卓轩	14ms	392 KiB	210 Bytes	2022-9-10 15:10:31
AC	六 (江智昕)	14ms	384 KiB	177 Bytes	2022-12-29 16:51:12
AC	一片落叶 (yeyuhao)	14ms	6.7 MiB	140 Bytes	2023-8-24 14:59:39
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	14ms	444 KiB	166 Bytes	2022-7-21 11:44:55
AC	zhangxs	14ms	6.8 MiB	162 Bytes	2023-6-11 16:22:47
AC	胡津豪11	14ms	6.8 MiB	173 Bytes	2023-10-3 16:53:46
AC	王昱祺 (12王昱祺)	14ms	384 KiB	169 Bytes	2023-3-26 17:35:59
AC	lao_ba	14ms	6.7 MiB	164 Bytes	2023-9-30 16:26:57
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	14ms	512 KiB	166 Bytes	2022-8-30 18:53:07
AC	余晨浩 (yuchenhao)	14ms	6.7 MiB	156 Bytes	2023-8-31 14:40:21
AC	zhangyouze (张佑泽)	14ms	6.8 MiB	164 Bytes	2023-10-21 23:50:37
AC	六 (江智昕)	14ms	392 KiB	177 Bytes	2022-12-29 16:51:11
AC	zhangxinyue	14ms	384 KiB	134 Bytes	2022-11-12 12:33:39
AC	罗伟杰 (13308275065)	14ms	512 KiB	177 Bytes	2022-12-8 19:51:50
AC	hyh	14ms	384 KiB	166 Bytes	2023-3-18 11:21:39
AC	金沙校区-王俊元 (王俊元)	14ms	6.7 MiB	178 Bytes	2023-9-23 21:53:04
AC	贾博涵	14ms	6.8 MiB	133 Bytes	2023-11-2 15:06:08
AC	GYZ	14ms	444 KiB	214 Bytes	2022-3-13 19:27:54
AC	司雨来 (siyulai)	14ms	384 KiB	194 Bytes	2022-10-6 16:34:01
AC	杨朔	14ms	7 MiB	178 Bytes	2023-10-29 18:44:52
AC	pandap&a王皓宸 (WANGHAOCHEN)	15ms	444 KiB	150 Bytes	2022-11-5 11:16:10
AC	时代一校蒋帛希 (13983392730)	15ms	436 KiB	145 Bytes	2022-9-18 18:46:06
AC	SHY20091224	15ms	384 KiB	152 Bytes	2022-8-7 10:57:33
AC	dxjbmwclh	15ms	512 KiB	150 Bytes	2022-11-7 21:13:35
AC	中岛敦 (黄麒瑞)	15ms	436 KiB	197 Bytes	2023-2-3 10:58:10
AC	陈于硕(我™的) (chenyu)	15ms	436 KiB	178 Bytes	2023-2-18 11:32:48
AC	余晨浩 (yuchenhao)	15ms	7 MiB	144 Bytes	2023-8-31 14:50:49
AC	六 (江智昕)	15ms	392 KiB	177 Bytes	2022-12-29 16:51:13
AC	wzzjnb2012	15ms	444 KiB	193 Bytes	2022-9-25 22:19:56
AC	李晨希	15ms	384 KiB	163 Bytes	2023-5-24 19:21:54
AC	小忙果 (王昱杰)	15ms	448 KiB	167 Bytes	2023-2-8 20:03:55
AC	陈年保宁醋 (dengboren)	15ms	384 KiB	211 Bytes	2022-1-22 20:21:57
AC	SHY20091224	15ms	384 KiB	152 Bytes	2022-8-7 10:57:33
AC	六 (江智昕)	15ms	416 KiB	177 Bytes	2022-12-29 16:51:07
AC	杨淇瑞 (杨淇瑞29)	15ms	6.7 MiB	196 Bytes	2023-9-19 20:49:37
AC	zzy	15ms	384 KiB	147 Bytes	2023-4-8 15:53:24
AC	六 (江智昕)	15ms	384 KiB	177 Bytes	2022-12-29 16:51:13
AC	黄立信	15ms	512 KiB	143 Bytes	2022-12-3 15:13:27
AC	爱琴海校区jzn (jzn)	15ms	436 KiB	161 Bytes	2023-3-4 9:47:08
AC	肖钦文 (xiaoqinwen)	15ms	384 KiB	170 Bytes	2022-8-23 10:37:11
AC	李樊駁	15ms	424 KiB	141 Bytes	2023-5-7 12:47:46
AC	SHY20091224	15ms	384 KiB	152 Bytes	2022-8-7 10:57:32
AC	刘鹤枫 (liuhefeng)	15ms	436 KiB	141 Bytes	2022-8-11 21:38:04
AC	童语铄	15ms	6.8 MiB	131 Bytes	2023-8-30 14:59:32
AC	wangyueru	15ms	512 KiB	152 Bytes	2022-9-10 19:40:43
AC	chenrunxiang22031	15ms	392 KiB	186 Bytes	2022-10-2 11:01:50
AC	金沙校区-蓝祥与 (蓝祥与)	15ms	512 KiB	184 Bytes	2022-11-30 20:36:27
AC	Tang	15ms	384 KiB	188 Bytes	2022-2-19 9:09:23
AC	任伊涵	15ms	6.9 MiB	178 Bytes	2023-7-28 16:30:32
AC	王祎辰 (wangyichen)	15ms	6.9 MiB	187 Bytes	2023-7-16 14:08:44
AC	赵彬鸿	15ms	392 KiB	138 Bytes	2022-8-12 15:28:47
AC	我是个s* (lijinze)	15ms	6.7 MiB	155 Bytes	2023-8-30 16:50:39
AC	余彦瑞	15ms	448 KiB	180 Bytes	2022-8-29 16:14:02
AC	yangyutong22003	15ms	424 KiB	148 Bytes	2023-2-18 17:24:17
AC	许嘉恩 (xje22031)	15ms	384 KiB	175 Bytes	2022-11-10 22:05:37
AC	六 (江智昕)	15ms	392 KiB	177 Bytes	2022-12-29 16:51:10
AC	牟淳雅	15ms	6.7 MiB	157 Bytes	2023-9-17 19:47:07
AC	Randy Marsh (杨子腾)	15ms	452 KiB	171 Bytes	2022-9-28 19:08:16
AC	颜梓宇	15ms	6.9 MiB	181 Bytes	2023-7-28 17:53:51
AC	余晨浩 (yuchenhao)	15ms	6.7 MiB	144 Bytes	2023-8-31 14:56:27
AC	hyc	15ms	440 KiB	182 Bytes	2023-3-18 11:21:19
AC	六 (江智昕)	15ms	404 KiB	177 Bytes	2022-12-29 16:51:12
AC	金锦泽 (jinjinze)	15ms	6.8 MiB	155 Bytes	2023-10-3 11:03:09
AC	周琪渃	15ms	512 KiB	181 Bytes	2022-12-3 15:06:17
AC	赵彬鸿	15ms	384 KiB	138 Bytes	2022-8-12 15:28:43