不与指定整数相同的数字之和

状态	递交者	时间	内存	语言	代码	递交时间
AC	赵彬鸿	14ms	384 KiB		212 Bytes	2022-8-13 15:50:02
AC	赵启程 (赵启程1)	14ms	384 KiB		275 Bytes	2023-4-8 19:58:47
AC	の (魏子恒)	14ms	532 KiB		258 Bytes	2022-8-31 18:48:39
AC	11111	14ms	384 KiB		271 Bytes	2022-4-17 11:11:35
AC	纪承熙 (jcx001)	14ms	440 KiB		295 Bytes	2022-9-24 17:04:03
AC	kim	14ms	384 KiB		301 Bytes	2023-2-10 21:05:59
AC	你爹 (郭铠嘉)	14ms	384 KiB		290 Bytes	2022-2-10 19:13:11
AC	煞笔笔	14ms	6.7 MiB		218 Bytes	2023-9-28 18:49:04
AC	luosifu22006	14ms	384 KiB		293 Bytes	2022-11-3 19:20:44
AC	赵彬鸿	14ms	384 KiB		212 Bytes	2022-8-13 15:49:59
AC	刘老师 (图书管理员)	14ms	440 KiB		275 Bytes	2022-7-30 16:38:59
AC	朱老师 (zyp)	14ms	440 KiB		224 Bytes	2022-7-31 16:06:19
AC	huyinuo	14ms	440 KiB		301 Bytes	2022-3-19 8:25:52
AC	赵彬鸿	14ms	384 KiB		370 Bytes	2022-5-28 15:21:24
AC	许徐非凡 (非同凡响)	14ms	384 KiB		230 Bytes	2023-3-11 19:14:43
AC	章愉霖	14ms	512 KiB		335 Bytes	2023-4-16 17:47:17
AC	赵彬鸿	14ms	384 KiB		370 Bytes	2022-5-28 15:21:24
AC	吴思谛 (wusidi)	14ms	384 KiB		227 Bytes	2022-6-30 10:40:00
AC	陈杰晟	14ms	384 KiB		271 Bytes	2022-2-13 15:28:18
AC	赵彬鸿	14ms	388 KiB		212 Bytes	2022-8-13 15:49:52
AC	邬文博 (wwb)	14ms	440 KiB		239 Bytes	2023-5-7 12:09:06
AC	yzl2	14ms	412 KiB		251 Bytes	2023-4-29 19:37:16
AC	范子煜	14ms	6.8 MiB	C++20	250 Bytes	2024-8-4 22:09:10
AC	张景豪	14ms	392 KiB		236 Bytes	2023-4-28 20:29:25
AC	dengyongjia	14ms	440 KiB		263 Bytes	2022-11-23 19:37:15
AC	文硕 (文硕1)	14ms	384 KiB		280 Bytes	2022-2-6 14:02:43
AC	唐钰豪	14ms	384 KiB		224 Bytes	2022-4-17 11:50:21
AC	陈祖明	14ms	404 KiB		229 Bytes	2022-2-12 15:47:43
AC	22016-tlr	14ms	392 KiB		251 Bytes	2022-9-18 9:54:22
AC	江坤锜	14ms	392 KiB		274 Bytes	2023-4-8 20:03:04
AC	hulang	14ms	384 KiB		373 Bytes	2022-2-14 18:43:22
AC	kim	14ms	392 KiB		301 Bytes	2023-2-10 21:06:00
AC	dyp (hhy)	14ms	6.7 MiB		257 Bytes	2023-9-2 12:56:14
AC	zhanghaoran	14ms	412 KiB		298 Bytes	2022-2-14 15:58:26
AC	新壹街校区-陈品烨 (陈品烨)	14ms	6.8 MiB		213 Bytes	2023-10-2 14:02:43
AC	金沙校区-蓝祥与 (蓝祥与)	14ms	384 KiB		270 Bytes	2023-4-15 14:08:48
AC	王浚西 (22016-wjx)	14ms	392 KiB		247 Bytes	2022-9-18 9:53:54
AC	任童(rentong)	14ms	448 KiB		292 Bytes	2022-7-2 14:58:57
AC	中二游侠(๑•̀ㅂ•́)و✧ (张凯翔)	14ms	384 KiB		263 Bytes	2022-10-28 21:10:28
AC	彭崇鑫	14ms	396 KiB		248 Bytes	2023-4-15 15:15:02
AC	ymh	14ms	412 KiB		236 Bytes	2022-2-14 15:40:05
AC	赵彬鸿	14ms	384 KiB		212 Bytes	2022-8-13 15:49:57
AC	kim	14ms	384 KiB		301 Bytes	2023-2-10 21:06:02
AC	蒋帅辉	14ms	384 KiB		271 Bytes	2022-2-12 15:49:04
AC	dld	14ms	7.2 MiB	C++98	257 Bytes	2024-4-28 20:03:47
AC	王涵熙 (水煮大肠)	14ms	512 KiB		244 Bytes	2022-3-5 16:35:49
AC	黄梓轩 (huangzixuan)	14ms	512 KiB		319 Bytes	2023-2-1 11:42:23
AC	明哲瀚 (18580067605)	14ms	432 KiB		272 Bytes	2023-2-15 20:27:59
AC	南坪校区-邵冠铖 (邵冠铖)	14ms	512 KiB		229 Bytes	2023-5-14 12:15:04
AC	熊奕博 (Mothefuck)	14ms	440 KiB		255 Bytes	2023-2-24 19:29:12
AC	error_sans	14ms	392 KiB		244 Bytes	2022-2-12 17:24:28
AC	经常消失 (小萝卜)	14ms	392 KiB		300 Bytes	2022-2-14 15:42:38
AC	赵彬鸿	14ms	384 KiB		212 Bytes	2022-8-13 15:49:52
AC	没有此人 (akm)	14ms	460 KiB		306 Bytes	2022-9-5 15:21:31
AC	伍芷函	14ms	384 KiB		252 Bytes	2023-1-31 10:56:00
AC	陈薪字	14ms	420 KiB		252 Bytes	2022-2-12 15:49:28
AC	zhuqiwei22006	14ms	432 KiB		206 Bytes	2022-6-5 17:19:41
AC	86想要钱 (twt)	14ms	384 KiB		260 Bytes	2022-10-30 19:11:16
AC	吴攸 (wuyou)	14ms	384 KiB		241 Bytes	2023-5-28 15:19:37
AC	WangXi	14ms	384 KiB		227 Bytes	2023-3-11 18:36:15
AC	童艺涵	14ms	392 KiB		233 Bytes	2023-4-15 14:14:34
AC	时代一校-王宥量 (wangyouliang)	14ms	512 KiB		241 Bytes	2022-11-6 15:24:30
AC	colin1112 (墙凌可)	14ms	6.7 MiB		250 Bytes	2023-9-1 17:08:10
AC	He Yiqi (和平精英)	14ms	384 KiB		319 Bytes	2022-2-12 11:22:25
AC	李奎龙 (Judge_lkl)	14ms	440 KiB		229 Bytes	2022-10-29 20:53:56
AC	Yangshenxin (𝒲𝒶𝓉𝑒𝓇)	14ms	392 KiB		405 Bytes	2022-1-23 18:41:22
AC	王浚西 (22016-wjx)	14ms	512 KiB		247 Bytes	2022-9-18 9:53:54
AC	强愉堃 (强愉堃1)	14ms	512 KiB		220 Bytes	2023-4-13 20:13:35
AC	dustsans (njo)	14ms	384 KiB		232 Bytes	2022-9-9 20:32:01
AC	张子轩 (zhangzixuana)	14ms	512 KiB		231 Bytes	2023-5-3 9:27:07
AC	谢博文	14ms	392 KiB		271 Bytes	2022-2-12 11:15:17
AC	雷文博（帅哥） (18983951391)	14ms	392 KiB		229 Bytes	2023-2-12 15:06:02
AC	赵彬鸿	14ms	384 KiB		212 Bytes	2022-8-13 15:50:00
AC	XYZ303	14ms	384 KiB		257 Bytes	2022-1-18 11:25:47
AC	李哲 (lizhe)	14ms	512 KiB		265 Bytes	2022-7-20 12:00:15
AC	王浚西 (22016-wjx)	14ms	384 KiB		247 Bytes	2022-9-18 9:53:55
AC	22029-zjs	14ms	384 KiB		338 Bytes	2023-3-25 11:50:46
AC	曹埊睿 (caodirui)	14ms	512 KiB		256 Bytes	2023-4-20 20:55:33
AC	时代一校蒋帛希 (13983392730)	14ms	384 KiB		258 Bytes	2022-10-30 19:14:39
AC	huanghaoming	14ms	384 KiB		233 Bytes	2022-8-16 11:38:43
AC	张子轩 (zhangzixuana)	14ms	392 KiB		327 Bytes	2022-10-30 11:57:53
AC	sqmyb	14ms	440 KiB		255 Bytes	2023-2-19 18:03:41
AC	中岛敦 (黄麒瑞)	14ms	6.8 MiB		329 Bytes	2023-10-2 14:18:33
AC	杜俊宏	14ms	392 KiB		274 Bytes	2022-2-12 15:50:37
AC	jinitaimei	14ms	512 KiB		248 Bytes	2023-3-5 12:05:30
AC	yanyuhan	14ms	384 KiB		287 Bytes	2023-5-28 14:54:27
AC	zhangyh (张育菡)	14ms	436 KiB		259 Bytes	2022-6-10 22:37:09
AC	赵鑫宸 (xiaoxiao721)	14ms	512 KiB		344 Bytes	2022-2-27 17:17:20
AC	陈家齐 (陈家齐1)	14ms	408 KiB		264 Bytes	2023-4-15 14:12:10
AC	殷语函	14ms	6.8 MiB		241 Bytes	2023-11-7 20:07:05
AC	刘政君 (lzj)	14ms	512 KiB		234 Bytes	2022-8-31 13:05:41
AC	yzl2	14ms	440 KiB		251 Bytes	2023-4-22 20:06:22
AC	luojunyang	14ms	512 KiB		267 Bytes	2022-1-21 9:55:09
AC	kcs007	14ms	512 KiB		243 Bytes	2023-4-15 14:12:40
AC	中二游侠(๑•̀ㅂ•́)و✧ (张凯翔)	14ms	512 KiB		263 Bytes	2022-9-10 10:46:26
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	392 KiB		298 Bytes	2022-11-27 9:43:24
AC	周靖松 (ZhouJS)	14ms	384 KiB		226 Bytes	2023-4-15 14:09:03
AC	赵彬鸿	14ms	384 KiB		212 Bytes	2022-8-13 15:50:03
AC	秦子越 (13883322087)	14ms	512 KiB		291 Bytes	2022-6-12 9:30:31
AC	renqiumo	14ms	424 KiB		235 Bytes	2022-2-17 20:30:36