奇偶数判断

状态	递交者	时间	内存	语言	代码	递交时间
AC	huanglu	13ms	7 MiB		174 Bytes	2023-7-15 14:58:24
AC	wangjunhan	13ms	512 KiB		156 Bytes	2022-3-2 19:54:15
AC	小忙果 (王昱杰)	13ms	436 KiB		156 Bytes	2023-2-21 20:39:12
AC	王祎辰 (wangyichen)	13ms	440 KiB		172 Bytes	2022-11-29 17:28:43
AC	吴俊成 (wujuncheng)	13ms	432 KiB		202 Bytes	2022-7-9 22:13:10
AC	张玉坚 (zhangyuian)	13ms	512 KiB		161 Bytes	2022-7-12 16:07:24
AC	胡瀚文	13ms	432 KiB		136 Bytes	2022-7-10 11:30:03
AC	源著校区-宋昊成 (马冬梅)	13ms	512 KiB		190 Bytes	2023-2-25 18:01:38
AC	SHY20091224	13ms	428 KiB		141 Bytes	2022-8-18 11:46:36
AC	李彦臻	13ms	7 MiB		162 Bytes	2024-1-6 15:20:47
AC	陈骏逸 (chenjunyi)	13ms	440 KiB		149 Bytes	2022-8-3 16:34:01
AC	时代一校黄誉翔 (huang)	13ms	512 KiB		127 Bytes	2022-10-22 17:20:04
AC	南坪校区-郑力博 (zhenglibo23003)	13ms	384 KiB		133 Bytes	2023-5-25 20:51:51
AC	Tang	13ms	384 KiB		187 Bytes	2022-2-19 9:28:12
AC	李禹衡 (liyuheng22006)	13ms	448 KiB		149 Bytes	2022-9-12 9:17:22
AC	罗竣瀚	13ms	480 KiB		137 Bytes	2022-10-22 19:36:23
AC	源著校区陈锐霖 (13983855850)	13ms	6.8 MiB	C++11	134 Bytes	2024-8-14 11:12:23
AC	时代二校-王盼兮 (wangpanxi)	13ms	384 KiB		171 Bytes	2023-3-18 11:30:40
AC	hst	13ms	436 KiB		157 Bytes	2022-3-12 17:21:52
AC	yu (赵子瑜)	13ms	436 KiB		151 Bytes	2022-2-24 21:17:00
AC	芒苒忧 (廖迦南)	13ms	392 KiB		188 Bytes	2022-1-25 15:19:51
AC	火爆肥肠（杨弘毅） (火爆肥肠)	13ms	512 KiB		189 Bytes	2022-3-4 22:24:40
AC	时代校区-刘臣原 (微笑王子)	13ms	392 KiB		138 Bytes	2022-4-5 20:25:46
AC	金沙校区-王俊元 (王俊元)	13ms	6.7 MiB		178 Bytes	2023-9-23 21:54:26
AC	22029-hqh	13ms	384 KiB		189 Bytes	2023-5-20 11:22:28
AC	12345	13ms	420 KiB		181 Bytes	2022-2-26 15:23:47
AC	罗伟杰 (13308275065)	13ms	384 KiB		177 Bytes	2022-9-25 20:53:27
AC	cxk123 (tanzixuan)	13ms	392 KiB		165 Bytes	2022-11-26 20:54:58
AC	zhangyouze (张佑泽)	13ms	6.8 MiB		163 Bytes	2023-10-22 8:57:04
AC	刘思齐	13ms	6.9 MiB	C++98	191 Bytes	2024-6-27 18:24:20
AC	陈杰晟	13ms	512 KiB		237 Bytes	2022-2-19 8:52:06
AC	马渝杭 (mayuhang)	13ms	384 KiB		139 Bytes	2022-11-5 14:30:13
AC	chenjunyao	13ms	6.9 MiB		152 Bytes	2023-8-20 17:40:57
AC	黄立信	13ms	6.8 MiB		163 Bytes	2023-10-12 20:10:57
AC	冯若涵	13ms	7.1 MiB		176 Bytes	2023-10-28 9:42:33
AC	徐正旺 (xzw)	13ms	440 KiB		142 Bytes	2022-8-13 17:00:42
AC	新壹街校区-杨轩懿 (杨轩懿1)	13ms	7 MiB		144 Bytes	2023-7-16 11:56:30
AC	孔思鳗	13ms	7.1 MiB		179 Bytes	2023-10-28 10:13:08
AC	呵呵呵 (陈思琦)	13ms	436 KiB		143 Bytes	2022-12-3 16:18:12
AC	贾博涵	13ms	6.8 MiB		133 Bytes	2023-11-7 14:38:20
AC	谢欣霖 (xiexinlin)	13ms	512 KiB		167 Bytes	2022-4-10 10:12:13
AC	谭懿轩 (yanyixuan)	13ms	432 KiB		139 Bytes	2022-2-15 13:43:12
AC	22029-hqh	13ms	384 KiB		189 Bytes	2023-5-20 11:22:32
AC	RanHao	13ms	6.9 MiB		133 Bytes	2023-7-22 9:35:42
AC	22029-hqh	13ms	384 KiB		189 Bytes	2023-5-20 11:22:28
AC	罗伟杰1	13ms	440 KiB		182 Bytes	2022-7-29 16:33:00
AC	极为的好van的 (lyq)	13ms	420 KiB		143 Bytes	2022-9-17 13:57:26
AC	杨瀚霖 (yanghanlin)	13ms	448 KiB		171 Bytes	2023-2-16 21:44:49
AC	xiongxinyao	13ms	436 KiB		228 Bytes	2022-11-17 19:35:15
AC	孔思鳗	13ms	7.1 MiB		179 Bytes	2023-10-28 10:09:51
AC	zhangheyi22006	13ms	384 KiB		137 Bytes	2022-11-27 17:28:36
AC	关博源	13ms	512 KiB		183 Bytes	2023-2-24 18:27:25
AC	牟淳雅	13ms	6.9 MiB		203 Bytes	2023-9-24 10:44:22
AC	杨淇瑞 (杨淇瑞29)	13ms	6.7 MiB		199 Bytes	2023-9-22 22:45:34
AC	林凡童 (lft)	13ms	6.9 MiB		165 Bytes	2023-7-16 15:08:06
AC	乐瀚阳 (yuehanyang)	13ms	444 KiB		159 Bytes	2023-3-18 15:36:35
AC	金沙校区-张斯瑒 (张斯瑒)	13ms	7.1 MiB		152 Bytes	2023-9-17 11:27:53
AC	我很6 (zjj22031)	13ms	436 KiB		161 Bytes	2023-3-19 9:47:30
AC	冯晨旭	13ms	7.1 MiB		203 Bytes	2023-10-28 9:41:48
AC	cheers 戴 (daizhuorun)	13ms	436 KiB		167 Bytes	2022-4-16 16:01:02
AC	陈廷恩	13ms	6.8 MiB		144 Bytes	2023-9-28 20:35:03
AC	文硕 (文硕1)	13ms	424 KiB		149 Bytes	2022-2-6 13:44:03
AC	新一街校区Jason_LuoYouZheng (罗友峥)	13ms	428 KiB		246 Bytes	2023-3-15 21:01:03
AC	谢博文	13ms	392 KiB		169 Bytes	2022-2-19 9:28:26
AC	sgc	13ms	432 KiB		169 Bytes	2022-8-13 11:10:11
AC	李山水	13ms	384 KiB		188 Bytes	2022-1-29 13:17:06
AC	向俊熙 (xiangjunxi23003)	13ms	6.9 MiB		136 Bytes	2023-7-27 15:42:30
AC	maobohan	13ms	512 KiB		166 Bytes	2023-3-4 9:12:16
AC	铁牛杰哥官方频道	13ms	436 KiB		139 Bytes	2022-3-9 20:20:09
AC	田开蕊	13ms	7.1 MiB		214 Bytes	2023-10-28 9:44:11
AC	yuchenyi23017	13ms	6.7 MiB		153 Bytes	2023-9-17 19:15:31
AC	朱彦搏	13ms	432 KiB		169 Bytes	2022-11-9 21:50:51
AC	李晨希	13ms	6.8 MiB		171 Bytes	2023-6-10 17:01:13
AC	liulinqi1	13ms	432 KiB		147 Bytes	2022-9-24 19:05:01
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)	13ms	432 KiB		159 Bytes	2023-5-15 18:48:35
AC	tsc_ (杨悦堃)	13ms	428 KiB		211 Bytes	2023-3-12 20:11:49
AC	xzf	13ms	6.8 MiB		202 Bytes	2023-6-23 15:46:55
AC	hnd (陈皓洋)	13ms	436 KiB		212 Bytes	2022-8-15 18:48:25
AC	tsc_ (杨悦堃)	13ms	384 KiB		225 Bytes	2023-3-12 20:12:14
AC	22029-zjs	13ms	396 KiB		196 Bytes	2023-3-25 11:18:13
AC	唐彬献	13ms	7.1 MiB		195 Bytes	2023-10-28 9:45:56
AC	yangbinyu	13ms	392 KiB		160 Bytes	2022-10-18 14:37:43
AC	11451254188 (22029-mjh)	13ms	512 KiB		156 Bytes	2022-11-11 13:05:17
AC	科比.布莱恩特 (董浩琰)	13ms	7.1 MiB		563 Bytes	2023-7-20 16:50:51
AC	tsc_ (杨悦堃)	13ms	384 KiB		225 Bytes	2023-3-12 20:11:59
AC	新壹街校区-陈琬舒 (空空大师)	13ms	6.9 MiB		142 Bytes	2023-7-31 11:18:43
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	13ms	440 KiB		179 Bytes	2022-9-17 21:17:07
AC	伍芷函	13ms	392 KiB		166 Bytes	2022-9-6 19:22:28
AC	孙天豪 (AliceSteven)	14ms	424 KiB		172 Bytes	2022-8-3 8:01:39
AC	wzzjnb2012	14ms	420 KiB		235 Bytes	2022-9-29 11:49:04
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	14ms	384 KiB		143 Bytes	2022-11-11 16:12:08
AC	陈雨泽1	14ms	384 KiB		170 Bytes	2023-2-11 10:30:35
AC	chaikexu	14ms	512 KiB		134 Bytes	2022-11-13 11:26:25
AC	Error404sans (焦阳浩云)	14ms	384 KiB		152 Bytes	2023-1-16 13:52:54
AC	林子沫awa (linziyue)	14ms	444 KiB		186 Bytes	2023-3-16 22:41:56
AC	周靖淞 (zhoujingsong)	14ms	6.9 MiB		156 Bytes	2023-6-18 16:13:01
AC	yanxiaosong	14ms	440 KiB		169 Bytes	2022-11-5 13:58:48
AC	罗莎莎	14ms	7.4 MiB		148 Bytes	2023-7-20 15:08:51
AC	hangge	14ms	440 KiB		163 Bytes	2023-5-30 19:17:39
AC	源著校区陈锐霖 (13983855850)	14ms	6.7 MiB		145 Bytes	2023-9-15 18:55:12