[基础题]最小公倍数和最大公约数

状态	递交者	时间	内存	语言	代码	递交时间
AC	22029-zjs	15ms	412 KiB		240 Bytes	2022-11-26 11:20:50
AC	关博源	15ms	384 KiB		217 Bytes	2023-4-1 11:19:59
AC	王乐仪	15ms	512 KiB		276 Bytes	2022-2-17 18:57:01
AC	高国瑞	15ms	6.9 MiB		208 Bytes	2023-7-16 17:22:09
AC	关博源	15ms	384 KiB		217 Bytes	2023-4-1 11:19:41
AC	曾龙兮	15ms	6.7 MiB		296 Bytes	2023-6-4 15:17:05
AC	关博源	15ms	416 KiB		217 Bytes	2023-4-1 11:20:02
AC	yuhaodi	15ms	436 KiB		248 Bytes	2023-5-11 15:54:20
AC	罗晨睿 (luochenrui)	15ms	392 KiB		255 Bytes	2022-10-30 14:05:04
AC	12345	15ms	440 KiB		413 Bytes	2022-11-19 14:58:12
AC	Nico	15ms	6.9 MiB		293 Bytes	2023-7-27 19:09:24
AC	guozuming	15ms	440 KiB		204 Bytes	2022-12-10 18:24:30
AC	关博源	15ms	384 KiB		217 Bytes	2023-4-1 11:19:57
AC	张景豪	15ms	6.5 MiB		206 Bytes	2023-6-3 20:26:58
AC	纪承熙 (jcx001)	15ms	384 KiB		265 Bytes	2022-12-10 18:16:33
AC	关博源	15ms	512 KiB		217 Bytes	2023-4-1 11:19:57
AC	曹埊睿 (caodirui)	15ms	436 KiB		203 Bytes	2023-3-25 10:53:44
AC	欧俊阳	15ms	6.9 MiB		222 Bytes	2023-7-26 21:16:16
AC	贾博涵	15ms	6.8 MiB		269 Bytes	2023-11-8 12:29:33
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)	15ms	512 KiB		400 Bytes	2022-11-20 17:08:24
AC	关博源	15ms	384 KiB		217 Bytes	2023-4-1 11:19:56
AC	wuqilin	15ms	6.9 MiB		214 Bytes	2023-6-29 12:18:11
AC	wuqi	16ms	6.9 MiB		285 Bytes	2023-8-1 16:40:59
AC	朱老师 (zyp)	16ms	384 KiB		268 Bytes	2023-4-19 20:40:10
AC	蒲梓勋 (puzixun)	16ms	436 KiB		242 Bytes	2022-11-29 22:30:03
AC	Tender. (05c05-zhou)	16ms	432 KiB		339 Bytes	2022-10-17 20:39:55
AC	colin1112 (墙凌可)	16ms	7.7 MiB		211 Bytes	2023-8-26 15:48:11
AC	周子涵	16ms	440 KiB		298 Bytes	2022-10-1 15:43:48
AC	zzy	16ms	432 KiB		317 Bytes	2023-4-8 16:13:05
AC	王祎辰 (wangyichen)	16ms	6.5 MiB		214 Bytes	2023-6-3 20:26:51
AC	yanglang	16ms	512 KiB		266 Bytes	2022-10-22 20:48:52
AC	李松泽 (lisongze)	16ms	384 KiB		301 Bytes	2022-10-27 20:33:57
AC	pandap&a王皓宸 (WANGHAOCHEN)	16ms	512 KiB		277 Bytes	2022-12-31 9:53:36
AC	任远宁 (renyuanning)	16ms	436 KiB		195 Bytes	2023-1-18 10:48:12
AC	RanHao	16ms	6.9 MiB		262 Bytes	2023-7-22 11:04:28
AC	杨浩灵 (金坷拉)	16ms	7 MiB		413 Bytes	2023-7-20 17:12:37
AC	yxj	16ms	436 KiB		220 Bytes	2022-10-20 16:00:19
AC	huanglu	16ms	6.9 MiB		224 Bytes	2023-7-15 16:26:08
AC	关博源	16ms	384 KiB		217 Bytes	2023-4-1 11:19:52
AC	繁星 (05c35-zzm)	16ms	512 KiB		266 Bytes	2022-11-15 17:11:42
AC	wuqi	17ms	6.9 MiB		285 Bytes	2023-8-1 16:41:07
AC	新壹街陈科言 (cky)	17ms	6.9 MiB		480 Bytes	2023-7-20 13:45:53
AC	三差学生 (尘埃蓝莓)	17ms	6.5 MiB		189 Bytes	2023-6-3 20:27:20
AC	xflt_dyp	17ms	6.9 MiB		262 Bytes	2023-7-22 16:44:26
AC	时代一校-赵彦博 (zyb)	17ms	6.9 MiB		194 Bytes	2023-8-3 14:37:05
AC	爱琴海校区-刁钲洋 (刁钲洋)	17ms	6.9 MiB		305 Bytes	2023-8-13 15:10:03
AC	12345	17ms	512 KiB		413 Bytes	2022-8-24 9:10:13
AC	牟淳雅	18ms	6.9 MiB		235 Bytes	2023-7-30 16:27:47
AC	NJL (NJlL)	18ms	392 KiB		375 Bytes	2022-5-8 17:58:53
AC	牟淳雅	18ms	6.9 MiB		235 Bytes	2023-7-30 16:29:06
AC	李彦臻	19ms	7.3 MiB		235 Bytes	2024-1-6 15:23:18
AC	赵鑫宸 (xiaoxiao721)	19ms	512 KiB		292 Bytes	2022-11-5 13:19:24
AC	新壹街—熊轩杭 (xiongxuanhang)	19ms	7.1 MiB		363 Bytes	2024-1-18 17:22:20
AC	暗蛆突围 (lzh)	20ms	7 MiB		675 Bytes	2023-12-28 18:23:15
AC	没有此人 (akm)	21ms	7 MiB		253 Bytes	2023-12-13 21:53:39
AC	叶雨昊 (yeyuhao22006)	23ms	436 KiB		236 Bytes	2022-10-23 19:48:30
AC	zyl	26ms	7.3 MiB		193 Bytes	2024-1-3 18:24:32
AC	时代二校-王盼兮 (wangpanxi)	31ms	7 MiB		217 Bytes	2024-1-14 11:39:10
AC	dyp (hhy)	40ms	6.9 MiB		425 Bytes	2023-12-8 19:29:35
AC	My name is Man (钟卓劭)	58ms	764 KiB		164 Bytes	2024-4-4 11:25:36
AC	时代1校-杨宇轩 (杨宇轩)	62ms	764 KiB		217 Bytes	2024-4-14 11:30:14
AC	沈煜恒 (一位老六)	62ms	764 KiB		165 Bytes	2024-4-4 11:23:45
AC	张瑞博	65ms	764 KiB	C++11	313 Bytes	2024-9-10 11:36:33
AC	scallway	65ms	540 KiB		255 Bytes	2024-4-13 11:26:55
AC	叶哲宇 (yzy)	66ms	544 KiB		204 Bytes	2024-3-23 21:49:35
AC	时代一校石博文 (shibowen)	66ms	764 KiB		518 Bytes	2024-2-16 15:47:51
AC	时代校区-孔令皓 (konglinghao)	66ms	548 KiB		132 Bytes	2024-4-13 16:49:27
AC	呵呵呵 (陈思琦)	67ms	544 KiB		221 Bytes	2024-2-17 15:42:50
AC	张祖名	67ms	532 KiB		226 Bytes	2024-3-17 11:04:54
AC	煞笔笔	67ms	536 KiB		225 Bytes	2024-4-14 11:29:49
AC	三差学生(尘埃蓝莓) (白佳睿)	68ms	764 KiB		231 Bytes	2024-4-13 11:27:17
AC	U城校区-邓皓月 (邓皓月)	68ms	540 KiB		240 Bytes	2024-4-6 13:35:27
AC	张梓浩 (zhangzihao)	68ms	620 KiB		274 Bytes	2024-4-14 11:29:58
AC	许律天	68ms	536 KiB		234 Bytes	2024-3-1 13:52:54
AC	ReFly (NKZKY)	69ms	532 KiB		214 Bytes	2024-2-1 16:56:15
AC	杨博文05	71ms	764 KiB	C++98	212 Bytes	2024-9-17 15:30:00
AC	吴攸 (wuyou)	75ms	540 KiB		231 Bytes	2024-4-14 11:30:30
AC	明轩 (吕同学)	112ms	9.3 MiB	Python 3	173 Bytes	2024-5-22 22:20:05
AC	fcxin	121ms	9.4 MiB	Python 3	90 Bytes	2024-8-7 15:27:03
AC	安闵煜 (anzai)	172ms	9.2 MiB	Python 3	95 Bytes	2023-11-6 0:29:59
AC	可爱酱 (张可忻)	179ms	9.1 MiB	Python 2	258 Bytes	2023-8-17 23:23:01
AC	19598	186ms	9 MiB	Python 3	167 Bytes	2023-8-11 16:51:08
AC	伍行念 (wuxingnian)	188ms	9.1 MiB	Python 3	97 Bytes	2023-9-21 18:21:22
AC	penghy	189ms	9 MiB	Python 3	138 Bytes	2023-8-12 18:28:52
AC	猫不理包子	190ms	9.1 MiB	Python 3	192 Bytes	2023-6-16 15:00:39
AC	星野光 (Hoshino Hikari)	196ms	9.1 MiB	Python 3	123 Bytes	2023-10-23 20:06:26
AC	范老师	196ms	3.9 MiB	Python 3	120 Bytes	2022-8-10 11:31:56
AC	樊竣熠 (lft1114)	198ms	3.9 MiB	Python 3	145 Bytes	2022-2-23 21:41:43
AC	zzt	199ms	3.9 MiB	Python 3	145 Bytes	2022-4-4 10:34:33
AC	梨冻亿 (wiueh)	202ms	3.9 MiB	Python 3	162 Bytes	2022-1-22 20:51:41
AC	冒牌陈杰晟【MOD】 (wed)	203ms	3.9 MiB	Python 3	145 Bytes	2022-3-6 16:02:59
AC	苗润昊	205ms	3.9 MiB	Python 3	162 Bytes	2022-1-25 15:31:13
AC	cola	210ms	3.9 MiB	Python 3	206 Bytes	2022-12-15 17:22:09
AC	kongql	212ms	4 MiB	Python 3	140 Bytes	2022-7-17 15:01:45
AC	11111	216ms	3.9 MiB	Python 3	152 Bytes	2022-2-23 19:32:50
AC	11111	216ms	3.9 MiB	Python 3	152 Bytes	2022-2-23 19:32:50
AC	汪致卉 (wangzh)	218ms	3.9 MiB	Python 3	145 Bytes	2022-1-22 19:28:25
AC	稻妻第一深情 (喝酒の吟游诗人)	221ms	4 MiB	Python 3	191 Bytes	2023-1-11 15:42:19
AC	谭红中 (不知道)	226ms	3.9 MiB	Python 3	343 Bytes	2022-3-28 18:40:06
AC	AAA家电维修李师傅 (libo)	493ms	3.8 MiB	Python 3	240 Bytes	2024-4-14 16:16:44