整数大小比较

状态	递交者	时间	内存	语言	代码	递交时间
AC	吴恩子	12ms	6.8 MiB		177 Bytes	2023-10-11 20:59:25
AC	aoyu22003	12ms	396 KiB		185 Bytes	2023-2-18 17:12:42
AC	我全家SB！！！我没母！！！ (baijinlin)	12ms	384 KiB		180 Bytes	2023-2-18 17:09:46
AC	王胤钦 (wangyinqin)	12ms	384 KiB		204 Bytes	2022-4-30 16:22:45
AC	疯神芭芭脱丝 (李卓修)	12ms	420 KiB		218 Bytes	2022-1-21 19:34:53
AC	况奕辛 (KYX_yyds)	12ms	392 KiB		228 Bytes	2022-1-2 19:56:15
AC	明哲瀚 (18580067605)	12ms	384 KiB		222 Bytes	2022-9-14 19:21:51
AC	炼狱杏寿郎（的粉粉粉粉粉） (sheijiangwohh)	12ms	392 KiB		294 Bytes	2022-3-5 23:30:54
AC	huyunyi23003	12ms	384 KiB		182 Bytes	2023-2-18 17:07:33
AC	靳博然 (jbr)	12ms	436 KiB		223 Bytes	2023-4-9 17:56:13
AC	黄梓轩 (huangzixuan)	12ms	436 KiB		225 Bytes	2022-6-28 17:46:23
AC	张桐玮	12ms	384 KiB		170 Bytes	2023-2-18 11:56:07
AC	陈忝锐	12ms	440 KiB		198 Bytes	2022-4-19 19:23:16
AC	文硕 (文硕1)	12ms	436 KiB		230 Bytes	2022-7-12 11:22:41
AC	liuyuchen	12ms	384 KiB		222 Bytes	2023-2-19 15:44:30
AC	李奕霖 (liyilin233)	12ms	384 KiB		152 Bytes	2022-4-9 19:49:28
AC	icwy (zuolun)	12ms	384 KiB		198 Bytes	2022-4-9 14:29:20
AC	22029-hqh	12ms	384 KiB		180 Bytes	2023-5-20 11:24:58
AC	周浩楠 (开朗的周好难)	12ms	6.7 MiB		173 Bytes	2023-9-23 20:45:44
AC	胡瀚文	12ms	512 KiB		150 Bytes	2022-7-10 11:28:25
AC	赵彬鸿	12ms	392 KiB		212 Bytes	2022-4-30 14:07:33
AC	时代一校蒋帛希 (13983392730)	12ms	428 KiB		166 Bytes	2022-9-18 18:37:59
AC	新壹街校区-罗斤天 (罗斤天)	12ms	384 KiB		204 Bytes	2022-4-30 16:27:46
AC	明哲瀚 (18580067605)	12ms	512 KiB		222 Bytes	2022-9-15 21:20:35
AC	明哲瀚 (18580067605)	12ms	512 KiB		303 Bytes	2022-9-12 13:03:03
AC	赵彬鸿	12ms	384 KiB		212 Bytes	2022-4-30 14:07:39
AC	zhanglianjie	12ms	384 KiB		176 Bytes	2023-2-18 17:11:55
AC	肖添宇	12ms	420 KiB		229 Bytes	2022-4-23 17:31:34
AC	陈思彤	12ms	384 KiB		245 Bytes	2023-5-21 15:41:02
AC	吃小孩的viv_	12ms	444 KiB		213 Bytes	2022-6-10 10:29:44
AC	六 (江智昕)	12ms	512 KiB		218 Bytes	2022-12-29 16:44:18
AC	xxteacher	12ms	392 KiB		284 Bytes	2022-1-28 12:30:52
AC	tsc_ (杨悦堃)	12ms	436 KiB		225 Bytes	2023-2-24 20:14:58
AC	汪致卉 (wangzh)	12ms	396 KiB		216 Bytes	2022-1-22 19:13:03
AC	没有此人 (akm)	12ms	7.1 MiB		214 Bytes	2023-12-8 18:14:02
AC	杨淇瑞 (杨淇瑞29)	12ms	384 KiB		248 Bytes	2023-4-19 20:32:19
AC	17783879785	12ms	440 KiB		205 Bytes	2022-9-16 21:46:52
AC	Steven (王梓丞)	12ms	552 KiB		235 Bytes	2022-4-16 13:54:00
AC	黄立信	12ms	6.8 MiB		245 Bytes	2023-10-12 20:10:43
AC	22029-hqh	12ms	384 KiB		180 Bytes	2023-5-20 11:25:00
AC	大马猴 (周琳竣)	12ms	6.9 MiB		190 Bytes	2023-7-26 19:30:05
AC	aoyu22003	12ms	384 KiB		185 Bytes	2023-2-18 17:11:17
AC	赵彬鸿	12ms	384 KiB		212 Bytes	2022-4-30 14:07:40
AC	六 (江智昕)	12ms	384 KiB		218 Bytes	2022-12-29 16:44:21
AC	刘泽21	12ms	384 KiB		257 Bytes	2023-4-14 13:00:02
AC	赵彬鸿	12ms	392 KiB		212 Bytes	2022-4-30 14:07:40
AC	霍弈丞	12ms	384 KiB		235 Bytes	2022-2-27 12:00:04
AC	1 (秦子栋)	12ms	384 KiB		237 Bytes	2023-5-21 15:43:01
AC	高致远 (GZY)	12ms	384 KiB		181 Bytes	2022-2-13 10:56:11
AC	姚宏逸	12ms	392 KiB		202 Bytes	2022-1-30 21:50:46
AC	杨在云 (yangzaiyun001)	12ms	384 KiB		177 Bytes	2022-9-3 20:41:18
AC	我全家SB！！！我没母！！！ (baijinlin)	12ms	384 KiB		180 Bytes	2023-2-18 17:09:52
AC	赵彬鸿	12ms	384 KiB		212 Bytes	2022-4-30 14:07:35
AC	12345	12ms	432 KiB		223 Bytes	2022-2-26 15:36:40
AC	tad (OP AI)	12ms	7 MiB	C++98	203 Bytes	2024-6-16 15:36:59
AC	hnd (陈皓洋)	12ms	436 KiB		238 Bytes	2022-8-16 15:30:40
AC	明哲瀚 (18580067605)	12ms	384 KiB		303 Bytes	2022-9-12 13:03:03
AC	程舒然	12ms	6.6 MiB	C++11	190 Bytes	2024-7-11 10:52:46
AC	李嘉瑞	12ms	384 KiB		227 Bytes	2022-4-9 19:36:24
AC	22029-hqh	12ms	384 KiB		180 Bytes	2023-5-20 11:25:10
AC	赵彬鸿	12ms	512 KiB		212 Bytes	2022-4-30 14:07:35
AC	傅博涛	12ms	384 KiB		169 Bytes	2022-1-30 17:18:47
AC	陈骏洋	12ms	384 KiB		201 Bytes	2022-4-5 18:20:43
AC	赵一嵘 (zhaoyirong)	12ms	432 KiB		186 Bytes	2023-3-1 22:14:28
AC	朱老师 (zyp)	12ms	384 KiB		175 Bytes	2023-2-18 17:08:01
AC	经常消失 (小萝卜)	12ms	392 KiB		234 Bytes	2022-1-25 13:55:31
AC	zhr	12ms	384 KiB		171 Bytes	2023-4-8 12:06:26
AC	王宇桐 (我是外挂)	12ms	436 KiB		229 Bytes	2022-2-19 11:59:34
AC	wangziji	12ms	392 KiB		176 Bytes	2023-3-18 9:58:23
AC	叶哲宇 (yzy)	12ms	392 KiB		182 Bytes	2023-4-8 11:50:22
AC	新壹街校区-郭老师-陈品烨 (陈品烨)	12ms	6.7 MiB		167 Bytes	2023-10-1 10:35:13
AC	明哲瀚 (18580067605)	12ms	384 KiB		303 Bytes	2022-9-12 13:03:02
AC	liulinqi1	12ms	440 KiB		191 Bytes	2022-10-2 19:02:27
AC	panyan	12ms	392 KiB		190 Bytes	2022-4-30 14:06:49
AC	Him神	12ms	6.8 MiB		191 Bytes	2023-10-6 15:25:04
AC	蒲梓勋 (puzixun)	12ms	436 KiB		187 Bytes	2022-7-13 19:38:36
AC	11451254188 (22029-mjh)	12ms	384 KiB		198 Bytes	2022-11-13 11:15:25
AC	张子扬	12ms	512 KiB		236 Bytes	2022-3-1 21:33:40
AC	刘鹤枫 (liuhefeng)	12ms	436 KiB		212 Bytes	2023-2-15 15:24:20
AC	星野光 (Hoshino Hikari)	12ms	6.8 MiB		273 Bytes	2023-10-21 22:15:04
AC	杜是贤 (dushixian)	12ms	512 KiB		163 Bytes	2022-7-5 13:04:20
AC	孔思鳗	12ms	7.2 MiB		198 Bytes	2023-10-28 11:23:25
AC	张雯皓 (zhangwenhao)	12ms	392 KiB		243 Bytes	2023-4-8 12:12:34
AC	你爹 (郭铠嘉)	12ms	432 KiB		185 Bytes	2022-2-12 18:39:39
AC	宋坤霖	12ms	7.1 MiB	C++11	128 Bytes	2024-4-20 13:26:26
AC	yu (赵子瑜)	12ms	392 KiB		189 Bytes	2022-3-2 20:04:53
AC	林小博	12ms	392 KiB		242 Bytes	2022-3-5 11:11:05
AC	钟京润	12ms	512 KiB		210 Bytes	2022-4-5 14:21:08
AC	陈秋石	12ms	384 KiB		195 Bytes	2022-2-27 11:22:25
AC	张泰凌 (ztl)	12ms	512 KiB		201 Bytes	2022-2-13 10:59:18
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	448 KiB		183 Bytes	2023-5-15 19:20:58
AC	时代一校-曾科智 (曾科智)	12ms	440 KiB		251 Bytes	2022-9-4 8:04:50
AC	yu (赵子瑜)	12ms	392 KiB		189 Bytes	2022-3-2 20:04:52
AC	吴卓轩	12ms	392 KiB		241 Bytes	2022-9-10 14:47:30
AC	六 (江智昕)	12ms	384 KiB		218 Bytes	2022-12-29 16:44:19
AC	蒋丁非凡	12ms	6.8 MiB		180 Bytes	2023-10-27 19:59:10
AC	何镇西1	12ms	6.9 MiB		149 Bytes	2023-7-27 18:15:03
AC	chaikexu	12ms	384 KiB		163 Bytes	2022-11-13 11:28:31
AC	李某人	12ms	392 KiB		231 Bytes	2022-1-26 11:34:34
AC	chenjunyao	12ms	384 KiB		176 Bytes	2023-4-8 11:39:16