等差数列末项计算

状态	递交者	时间	内存	语言	代码	递交时间
AC	杨瀚霖 (yanghanlin)	15ms	6.8 MiB		125 Bytes	2023-6-10 18:22:32
AC	jdy	15ms	384 KiB		210 Bytes	2022-12-16 12:33:14
AC	黄誉翔 (黄誉翔)	15ms	432 KiB		146 Bytes	2022-10-23 11:21:39
AC	colin1112 (墙凌可)	15ms	424 KiB		145 Bytes	2023-3-11 15:00:04
AC	时代一校林星宇 (lxy)	15ms	512 KiB		139 Bytes	2022-10-22 21:08:24
AC	杨在云 (yangzaiyun001)	15ms	512 KiB		131 Bytes	2022-8-29 14:39:41
AC	Jack	15ms	7.1 MiB		119 Bytes	2023-7-12 10:23:06
AC	小忙果 (王昱杰)	16ms	6.9 MiB		159 Bytes	2023-7-18 8:40:03
AC	RanHao	16ms	6.9 MiB		152 Bytes	2023-7-22 11:32:50
AC	向俊熙 (xiangjunxi23003)	16ms	440 KiB		116 Bytes	2023-3-22 16:50:30
AC	wangyueru	16ms	440 KiB		135 Bytes	2022-10-22 19:41:00
AC	胡宸华 (huchenhua)	16ms	428 KiB		175 Bytes	2022-11-12 22:59:54
AC	邵冠铖 (shaoguancheng22031)	16ms	548 KiB		264 Bytes	2022-11-16 19:34:13
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)	16ms	440 KiB		241 Bytes	2023-5-26 19:44:09
AC	坤坤荔枝小黑子 (zhonghaotian22006)	16ms	512 KiB		151 Bytes	2022-9-6 20:18:17
AC	时代一校-王宥量 (wangyouliang)	16ms	436 KiB		127 Bytes	2022-10-2 10:57:42
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	16ms	512 KiB		154 Bytes	2023-1-13 15:48:52
AC	马渝杭 (mayuhang)	16ms	452 KiB		152 Bytes	2023-3-21 19:09:56
AC	陈于硕(我™的) (chenyu)	16ms	6.7 MiB		158 Bytes	2023-6-5 19:29:14
AC	曹埊睿 (caodirui)	16ms	436 KiB		150 Bytes	2023-4-17 19:20:03
AC	杨坤霖 (steven)	16ms	432 KiB		119 Bytes	2023-1-16 8:46:13
AC	徐康景 (dcm)	16ms	512 KiB		179 Bytes	2022-12-9 22:57:43
AC	gmja	16ms	440 KiB		151 Bytes	2022-12-25 11:25:58
AC	缥 (王硕2012)	16ms	512 KiB		177 Bytes	2022-10-23 20:15:01
AC	yanglang	16ms	512 KiB		125 Bytes	2022-10-22 22:58:30
AC	wky	16ms	432 KiB		138 Bytes	2022-12-16 21:18:06
AC	陈秋石	16ms	512 KiB		125 Bytes	2022-8-26 13:38:27
AC	时代一校-赵彦博 (zyb)	16ms	6.9 MiB		129 Bytes	2023-8-4 15:36:19
AC	丛林 (conglin)	16ms	508 KiB		155 Bytes	2022-12-2 21:12:33
AC	胡澜之 (666hlz666)	17ms	512 KiB		172 Bytes	2023-4-27 20:32:51
AC	huanglu	17ms	436 KiB		221 Bytes	2022-12-13 15:15:44
AC	你猜呀	17ms	436 KiB		154 Bytes	2023-3-15 18:53:31
AC	zzzrrrxxx	17ms	6.9 MiB		121 Bytes	2023-8-19 18:53:49
AC	wzzjnb2012	17ms	512 KiB		152 Bytes	2022-10-2 17:35:40
AC	余彦瑞	18ms	472 KiB		144 Bytes	2022-8-29 16:26:42
AC	miku (阳沐珊)	18ms	436 KiB		143 Bytes	2023-5-27 20:54:37
AC	wangjun	20ms	6.5 MiB		323 Bytes	2023-11-19 11:12:42
AC	煞笔笔	20ms	7.1 MiB		122 Bytes	2024-1-19 10:57:54
AC	贾博涵	23ms	6.9 MiB		124 Bytes	2023-11-10 12:28:01
AC	李安桐23025	26ms	7 MiB		130 Bytes	2023-12-3 22:25:36
AC	zhm123	27ms	7.1 MiB		184 Bytes	2023-12-16 16:24:51
AC	弹射起飞 ? 冲 ! (吴周周)	27ms	7.1 MiB		228 Bytes	2024-1-24 10:05:11
AC	新壹街朱启航 (zhuqihang)	28ms	7.1 MiB		164 Bytes	2024-1-22 21:28:26
AC	时代一校-赵彦博 (zyb)	28ms	7.1 MiB		137 Bytes	2023-11-30 18:53:25
AC	在煎鱼的肖大总铳 (肖宇航)	58ms	712 KiB		124 Bytes	2024-3-17 9:17:15
AC	张智洋	61ms	536 KiB		162 Bytes	2024-3-16 16:52:51
AC	没有此人 (akm)	64ms	764 KiB		142 Bytes	2024-3-14 19:07:12
AC	My name is Man (钟卓劭)	65ms	536 KiB		120 Bytes	2024-3-3 15:29:23
AC	没有此人 (akm)	66ms	532 KiB		142 Bytes	2024-3-13 22:25:34
AC	wrz	66ms	768 KiB		159 Bytes	2024-3-8 15:31:19
AC	dyp (hhy)	67ms	532 KiB		139 Bytes	2024-1-27 17:15:49
AC	蒋金卓	67ms	532 KiB		173 Bytes	2024-1-29 16:37:32
AC	赵奕铭	69ms	540 KiB		166 Bytes	2024-3-25 21:43:32
AC	希蒙 (zhengxingya)	69ms	772 KiB		299 Bytes	2024-3-20 17:34:12
AC	新壹街校区-冉睦阳 (冉睦阳)	70ms	532 KiB	C++98	124 Bytes	2024-9-9 18:12:57
AC	希蒙 (zhengxingya)	70ms	532 KiB		299 Bytes	2024-3-20 17:34:17
AC	杨博文05	71ms	544 KiB	C++98	130 Bytes	2024-9-1 12:18:41
AC	dyp (hhy)	72ms	764 KiB		131 Bytes	2024-3-18 19:23:06
AC	张智洋	76ms	764 KiB		162 Bytes	2024-3-30 17:04:15
AC	fcxin	123ms	9.4 MiB	Python 3	94 Bytes	2024-8-8 16:43:59
AC	高俊	182ms	9.1 MiB	Python 3	94 Bytes	2023-10-13 17:00:35
AC	可爱酱 (张可忻)	190ms	9.1 MiB	Python 2	89 Bytes	2023-9-12 21:37:05
AC	安闵煜 (anzai)	193ms	9.1 MiB	Python 3	98 Bytes	2023-11-6 15:40:44
AC	许炜铭 (xuweiming)	195ms	9.1 MiB	Python 2	62 Bytes	2023-7-13 19:15:03
AC	kongql	195ms	4 MiB	Python 3	69 Bytes	2022-7-21 9:44:46
AC	19598	197ms	9 MiB	Python 3	84 Bytes	2023-8-12 14:53:58
AC	范老师	198ms	3.9 MiB	Python 3	79 Bytes	2022-8-17 18:19:28
AC	杨浩灵 (金坷拉)	201ms	9 MiB	Python 2	114 Bytes	2023-7-20 19:49:30
AC	梨冻亿 (wiueh)	206ms	3.9 MiB	Python 3	202 Bytes	2022-1-23 17:47:16
AC	Wling	210ms	4 MiB	Python 3	60 Bytes	2022-11-1 14:34:13
AC	11111	213ms	3.9 MiB	Python 3	95 Bytes	2022-2-14 16:20:28
AC	爱琴海校区-刁钲洋 (刁钲洋)	213ms	4 MiB	Python 3	55 Bytes	2022-5-4 21:53:09
AC	cola	214ms	3.9 MiB	Python 3	153 Bytes	2022-12-16 14:49:54
AC	11451254188 (22029-mjh)	215ms	3.9 MiB	Python 3	53 Bytes	2023-5-13 21:10:20
AC	谭红中 (不知道)	215ms	4 MiB	Python 3	56 Bytes	2023-1-14 9:34:48
AC	稻妻第一深情 (喝酒の吟游诗人)	222ms	3.9 MiB	Python 3	73 Bytes	2023-1-11 21:30:23
AC	猫不理包子	226ms	3.9 MiB	Python 3	98 Bytes	2023-1-13 14:32:54
AC	Qinxiu	532ms	3.8 MiB	Python 3	58 Bytes	2024-1-30 18:11:40
AC	周玉坤	546ms	4 MiB	Python 3	68 Bytes	2024-1-25 14:25:15