与7无关的数

状态	递交者	时间	内存	语言	代码	递交时间
AC	杨在云 (yangzaiyun001)	29ms	512 KiB		282 Bytes	2022-9-4 20:04:27
AC	文硕 (文硕1)	29ms	512 KiB		241 Bytes	2023-2-1 8:42:39
AC	17779	29ms	436 KiB		296 Bytes	2022-3-17 15:44:54
AC	陈杰晟	29ms	512 KiB		331 Bytes	2022-2-23 17:17:24
AC	任童(rentong)	29ms	512 KiB		324 Bytes	2022-7-2 14:57:33
AC	huanglu	29ms	6.9 MiB		240 Bytes	2023-7-18 11:11:51
AC	leisixian (22029-lyh)	29ms	512 KiB		432 Bytes	2022-12-3 18:16:34
AC	ganlin1	30ms	6.9 MiB		177 Bytes	2023-7-27 12:12:34
AC	zzl	30ms	6.8 MiB		305 Bytes	2023-11-7 1:10:07
AC	无尽的想象 (谭仕高)	30ms	6.9 MiB		259 Bytes	2023-8-15 11:43:33
AC	邹曜丞 (13983097018)	30ms	7 MiB		376 Bytes	2023-7-18 16:47:21
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)	30ms	392 KiB		372 Bytes	2023-2-11 11:21:24
AC	罗子琪	30ms	6.9 MiB		328 Bytes	2023-12-1 19:27:47
AC	Jack	30ms	440 KiB		318 Bytes	2023-3-23 19:58:37
AC	新壹街朱启航 (zhuqihang)	30ms	7.1 MiB		458 Bytes	2024-1-22 21:22:37
AC	胡宸华 (huchenhua)	30ms	432 KiB		359 Bytes	2022-11-29 0:16:30
AC	伍行念 (wuxingnian)	30ms	6.8 MiB		396 Bytes	2023-10-7 16:52:20
AC	源著校区-宋昊成 (马冬梅)	30ms	576 KiB		337 Bytes	2023-2-25 18:28:39
AC	蒲梓勋 (puzixun)	30ms	6.8 MiB		318 Bytes	2023-6-10 14:57:41
AC	colin1112 (墙凌可)	30ms	6.8 MiB		396 Bytes	2023-10-17 20:23:17
AC	kapurua	30ms	428 KiB		304 Bytes	2023-5-4 16:38:41
AC	新壹街校区-周士杰 (zsj)	31ms	6.8 MiB		202 Bytes	2023-9-16 20:53:15
AC	luoluonuoya	31ms	440 KiB		321 Bytes	2022-8-29 14:51:10
AC	新壹街校区-杨轩懿 (杨轩懿1)	31ms	6.9 MiB		292 Bytes	2023-7-25 12:08:23
AC	11451254188 (22029-mjh)	31ms	6.9 MiB		362 Bytes	2023-8-4 11:02:36
AC	22029-hqh	31ms	432 KiB		244 Bytes	2023-2-5 15:38:01
AC	朱老师 (zyp)	31ms	440 KiB		237 Bytes	2022-8-7 10:30:41
AC	郭人瑀1	31ms	512 KiB		321 Bytes	2022-8-7 20:49:39
AC	李睿杰	32ms	440 KiB		224 Bytes	2022-12-12 21:57:54
AC	小忙果 (王昱杰)	32ms	6.9 MiB		323 Bytes	2023-7-18 8:52:45
AC	不怎么聪明的家伙 (贺俊楠)	32ms	7.2 MiB		251 Bytes	2023-12-1 19:42:25
AC	zyl	32ms	7.3 MiB		446 Bytes	2024-1-4 10:54:22
AC	时代二校-焦雨齐 (Angel)	32ms	7 MiB		308 Bytes	2023-7-18 16:49:16
AC	Tender. (05c05-zhou)	33ms	436 KiB		305 Bytes	2023-2-17 20:10:56
AC	新壹街校区-陈琬舒 (空空大师)	33ms	7.2 MiB		276 Bytes	2023-11-25 11:43:48
AC	RanHao	33ms	6.9 MiB		456 Bytes	2023-7-22 18:42:39
AC	没有此人 (akm)	33ms	6.8 MiB		343 Bytes	2023-11-24 16:28:56
AC	周琪渃	33ms	512 KiB		205 Bytes	2023-3-19 21:36:34
AC	章愉霖	33ms	7.1 MiB		281 Bytes	2023-12-7 19:42:22
AC	新壹街校区--税崇峻 (税崇峻)	34ms	6.9 MiB		190 Bytes	2023-8-8 14:10:54
AC	程子杰 (05c41-czj)	34ms	436 KiB		378 Bytes	2022-7-27 10:48:58
AC	新壹街陈科言 (cky)	35ms	7 MiB		305 Bytes	2023-7-19 16:25:08
AC	爱琴海校区-黄辰浩 (huangchenhao)	39ms	7.3 MiB		318 Bytes	2023-11-25 11:38:38
AC	(张洛诚)	39ms	7.2 MiB		241 Bytes	2024-1-17 17:06:20
AC	贺睿林	40ms	6.8 MiB		183 Bytes	2023-11-25 7:57:50
AC	(金沙天街)严皓月 (严皓月)	40ms	6.9 MiB		353 Bytes	2023-11-25 11:22:04
AC	A小涂	41ms	6.9 MiB		300 Bytes	2023-11-25 8:38:06
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	41ms	7.2 MiB		334 Bytes	2023-12-3 15:37:24
AC	爱琴海校区-刁钲洋 (刁钲洋)	42ms	7 MiB		187 Bytes	2023-11-12 12:57:30
AC	张梓浩 (zhangzihao)	42ms	7.2 MiB		411 Bytes	2023-11-30 22:36:04
AC	许律天	44ms	7 MiB		187 Bytes	2023-12-26 22:45:52
AC	谭红中 (不知道)	45ms	7.3 MiB		174 Bytes	2024-1-17 16:59:05
AC	杨淇瑞 (杨淇瑞29)	47ms	7.2 MiB		475 Bytes	2024-1-18 15:26:54
AC	霍弈丞小号	47ms	7 MiB		290 Bytes	2023-12-3 12:25:37
AC	新壹街.曾祥睿 (zxr)	57ms	6.9 MiB		318 Bytes	2023-12-11 21:56:18
AC	江子墨	122ms	536 KiB		197 Bytes	2024-3-12 22:34:06
AC	Ryan	123ms	764 KiB		294 Bytes	2024-3-31 17:18:01
AC	胡益玮	125ms	768 KiB		523 Bytes	2024-2-28 19:23:04
AC	金沙-文豪 (wenhao)	127ms	764 KiB		333 Bytes	2024-3-3 17:45:39
AC	c (江宇轩)	127ms	764 KiB		340 Bytes	2024-3-11 21:37:04
AC	李浩然	129ms	532 KiB		392 Bytes	2024-2-28 19:27:07
AC	古煦涵	129ms	552 KiB	C++98	200 Bytes	2024-9-5 16:52:27
AC	Miao miao	130ms	536 KiB		293 Bytes	2024-3-10 19:57:18
AC	杨骏逸	130ms	764 KiB		279 Bytes	2024-2-25 9:44:15
AC	dyp (hhy)	130ms	536 KiB		432 Bytes	2024-1-28 12:18:30
AC	邱越	130ms	532 KiB		407 Bytes	2024-4-2 21:42:48
AC	张濯弋	131ms	536 KiB		310 Bytes	2024-1-27 18:00:13
AC	王紫月	131ms	764 KiB		287 Bytes	2024-2-24 16:47:33
AC	时代2校-程俊燃 (chengjunran)	132ms	532 KiB		241 Bytes	2024-1-30 12:08:44
AC	龚铭俊 (哈哈哈)	132ms	764 KiB		265 Bytes	2024-3-15 21:28:01
AC	扬子鳄	132ms	764 KiB		276 Bytes	2024-4-14 16:04:05
AC	My name is Man (钟卓劭)	133ms	544 KiB		313 Bytes	2024-2-22 16:10:25
AC	孙烽轶 (sfy)	133ms	764 KiB		170 Bytes	2024-2-19 19:54:08
AC	yuchenyi23017	135ms	772 KiB		204 Bytes	2024-1-28 13:32:36
AC	何镇西1	135ms	768 KiB	C++98	209 Bytes	2024-9-6 16:57:11
AC	杨博文05	136ms	768 KiB	C++98	200 Bytes	2024-9-10 18:07:53
AC	金沙—彭智宸 (彭智宸)	136ms	764 KiB		293 Bytes	2024-2-25 17:32:36
AC	吴沛宸	136ms	764 KiB		391 Bytes	2024-1-27 17:57:24
AC	WHWHWHWHWHW (OP AI)	138ms	772 KiB	C++11	298 Bytes	2024-9-15 12:52:24
AC	zyz (曾韵竹)	140ms	536 KiB	C++98	286 Bytes	2024-9-15 18:31:52
AC	吴子逸	140ms	764 KiB	C++98	271 Bytes	2024-9-6 15:24:51
AC	新壹街-王智琦 (王智琦)	140ms	764 KiB	C++11	214 Bytes	2024-9-5 18:14:36
AC	徐瑀阳	141ms	768 KiB	C++98	427 Bytes	2024-9-5 18:07:55
AC	zvt_132 (任子轩)	142ms	764 KiB	C++20	311 Bytes	2024-9-5 16:55:23
AC	fcxin	253ms	9.4 MiB	Python 3	164 Bytes	2024-8-9 13:40:42
AC	高俊	369ms	9.1 MiB	Python 3	230 Bytes	2023-10-19 15:01:22
AC	猫不理包子	370ms	9.1 MiB	Python 3	120 Bytes	2023-11-4 14:27:52
AC	可爱酱 (张可忻)	375ms	9.1 MiB	Python 3	267 Bytes	2023-10-10 13:29:19
AC	高俊	380ms	9.1 MiB	Python 3	222 Bytes	2023-10-19 14:58:50
AC	19598	383ms	9 MiB	Python 3	116 Bytes	2023-8-13 17:47:18
AC	猫不理包子	388ms	9.1 MiB	Python 3	259 Bytes	2023-11-4 14:28:22
AC	xxteacher	389ms	9 MiB	Python 3	315 Bytes	2023-7-22 10:36:44
AC	yangyaocheng	399ms	3.9 MiB	Python 3	142 Bytes	2022-5-22 14:35:50
AC	安闵煜 (anzai)	401ms	9.6 MiB	Python 3	130 Bytes	2023-11-9 9:56:09
AC	yangyaocheng	404ms	3.9 MiB	Python 3	142 Bytes	2022-5-22 14:35:51
AC	陈璟志 (cjz)	405ms	3.9 MiB	Python 3	134 Bytes	2022-5-22 17:00:54
AC	yangyaocheng	406ms	3.9 MiB	Python 3	142 Bytes	2022-5-22 14:35:52
AC	陈璟志 (cjz)	406ms	3.9 MiB	Python 3	134 Bytes	2022-5-22 14:40:53
AC	hrx	407ms	3.9 MiB	Python 3	128 Bytes	2022-5-22 17:14:24
AC	sg.小羽	407ms	3.9 MiB	Python 3	156 Bytes	2022-5-28 15:56:17