余数相同问题

状态	递交者	时间	内存	语言	代码	递交时间
AC	执剑人罗辑 (Jasson)	8ms	456 KiB		235 Bytes	2023-5-13 16:07:53
AC	zhm123	8ms	448 KiB		161 Bytes	2023-1-2 14:45:51
AC	我是2b+傻逼 (chenyuxuan)	8ms	432 KiB		192 Bytes	2023-3-18 10:27:10
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)	8ms	384 KiB		252 Bytes	2023-5-19 16:49:19
AC	时代二校+王吕棪 (wanglvyan)	8ms	6.8 MiB		197 Bytes	2023-6-24 17:51:23
AC	kql1	8ms	7.1 MiB	C++98	271 Bytes	2024-5-9 13:31:42
AC	呵呵呵 (陈思琦)	8ms	508 KiB		232 Bytes	2022-10-15 17:15:39
AC	神秘黑客	8ms	432 KiB		201 Bytes	2022-12-9 22:23:11
AC	阮 (媚狐不吃道旁李)	8ms	6.9 MiB	C++98	223 Bytes	2024-4-29 19:47:24
AC	黄立信	8ms	512 KiB		253 Bytes	2023-4-27 21:16:52
AC	代尚函笛卡尔 (daishanghan)	8ms	428 KiB		201 Bytes	2022-11-1 20:47:58
AC	yangbinyu	8ms	420 KiB		199 Bytes	2022-11-2 20:45:51
AC	zyl	8ms	7.3 MiB		267 Bytes	2024-1-21 14:08:04
AC	wzzjnb2012	8ms	436 KiB		276 Bytes	2022-10-3 22:17:12
AC	金沙—彭智宸 (彭智宸)	8ms	6.9 MiB		169 Bytes	2023-8-17 9:25:09
AC	贾鑫豪 (Mr Sam)	8ms	512 KiB		210 Bytes	2023-1-9 17:00:43
AC	王胤钦 (wangyinqin)	8ms	436 KiB		195 Bytes	2023-5-4 20:29:00
AC	刘煜轩	8ms	7.2 MiB		202 Bytes	2023-11-25 11:19:26
AC	欧俊阳	8ms	6.7 MiB		230 Bytes	2023-8-25 13:20:07
AC	时代二校+马嘉宸 (majiachen)	8ms	6.8 MiB		195 Bytes	2023-7-1 16:40:49
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	8ms	392 KiB		199 Bytes	2023-1-15 16:53:31
AC	bilbil	8ms	6.8 MiB		184 Bytes	2023-7-1 16:40:32
AC	dustsans (njo)	8ms	436 KiB		235 Bytes	2023-3-10 16:45:34
AC	时代二校-焦雨齐 (Angel)	8ms	6.8 MiB		189 Bytes	2023-7-1 16:42:45
AC	啊...这 (炼狱杏寿郎)	8ms	432 KiB		237 Bytes	2023-1-9 16:46:19
AC	魑归sama	8ms	512 KiB		230 Bytes	2022-11-25 18:40:10
AC	李禹衡 (liyuheng22006)	8ms	436 KiB		187 Bytes	2022-12-7 18:21:31
AC	时代一校-赵彦博 (zyb)	8ms	436 KiB		218 Bytes	2023-3-16 22:11:38
AC	shenyushun2	8ms	512 KiB		200 Bytes	2022-12-24 22:07:30
AC	zhangheyi22006	8ms	436 KiB		221 Bytes	2022-12-9 19:57:49
AC	RanHao	8ms	6.9 MiB		273 Bytes	2023-8-8 17:04:52
AC	lch (凌昌瀚)	8ms	436 KiB		170 Bytes	2022-12-23 20:30:01
AC	dengduxi	8ms	384 KiB		202 Bytes	2023-1-13 14:26:25
AC	可爱的小花狗	8ms	6.8 MiB		223 Bytes	2023-7-1 16:47:26
AC	代尚函笛卡尔 (daishanghan)	8ms	512 KiB		201 Bytes	2023-1-13 14:22:06
AC	张智洋	9ms	6.8 MiB		177 Bytes	2023-7-1 16:43:52
AC	周子涵	9ms	440 KiB		177 Bytes	2022-10-1 16:36:46
AC	熊海阳 (xiongxaiyang)	9ms	6.9 MiB		194 Bytes	2023-8-12 10:33:59
AC	什蒂尔布 (吴东航)	9ms	436 KiB		311 Bytes	2023-3-11 15:34:02
AC	周浩楠 (开朗的周好难)	9ms	7.7 MiB		260 Bytes	2023-11-18 11:46:03
AC	12345	9ms	428 KiB		223 Bytes	2023-1-9 16:31:05
AC	我是周靖松长得帅 (mouyunqi)	9ms	6.9 MiB		184 Bytes	2023-8-3 10:48:15
AC	小根哥	9ms	432 KiB		199 Bytes	2022-8-25 12:19:48
AC	任舒尧	9ms	432 KiB		260 Bytes	2022-11-25 20:09:40
AC	没有此人 (akm)	10ms	6.9 MiB		241 Bytes	2023-7-3 8:26:53
AC	朱老师 (zyp)	10ms	384 KiB		262 Bytes	2023-5-23 21:34:25
AC	刘煜轩	11ms	7.2 MiB		195 Bytes	2023-11-25 11:22:54
AC	邵冠铖 (shaoguancheng22031)	12ms	384 KiB		172 Bytes	2022-11-28 20:17:53
AC	朱老师 (zyp)	13ms	416 KiB		238 Bytes	2022-11-28 20:17:35
AC	李龙腾 (llt)	16ms	440 KiB		246 Bytes	2022-9-10 20:33:14
AC	wangzihang	19ms	6.9 MiB		229 Bytes	2023-11-25 16:23:06
AC	wangjun	20ms	6.2 MiB		184 Bytes	2023-11-16 16:33:36
AC	新壹街—熊轩杭 (xiongxuanhang)	30ms	764 KiB		225 Bytes	2024-3-16 16:09:38
AC	新壹街校区-冉睦阳 (冉睦阳)	30ms	768 KiB		180 Bytes	2024-3-10 10:30:16
AC	xiangsiyu	31ms	384 KiB		321 Bytes	2022-6-25 21:00:05
AC	ReFly (NKZKY)	32ms	764 KiB		275 Bytes	2024-2-1 17:10:31
AC	陌生人 (涂玉龙)	32ms	532 KiB		190 Bytes	2024-3-17 15:25:20
AC	煞笔笔	32ms	536 KiB		181 Bytes	2024-2-25 15:29:25
AC	Harley (郑浩然)	34ms	532 KiB		210 Bytes	2024-2-23 20:32:15
AC	周靖淞 (zhoujingsong)	34ms	532 KiB		217 Bytes	2024-3-17 17:10:46
AC	孙烽轶 (sfy)	34ms	548 KiB		229 Bytes	2024-3-4 20:17:53
AC	Billy52013 (李子轩)	34ms	532 KiB		195 Bytes	2024-3-9 20:13:07
AC	千千万万	35ms	532 KiB		208 Bytes	2024-3-17 17:25:55
AC	小码王高新校区—刘晨皓 (shishen)	35ms	580 KiB		170 Bytes	2024-4-14 16:24:50
AC	zyz (曾韵竹)	35ms	764 KiB		179 Bytes	2024-3-17 17:18:11
AC	U城校区-邓皓月 (邓皓月)	36ms	764 KiB		216 Bytes	2024-2-19 20:02:38
AC	三差学生 (尘埃蓝莓)	36ms	540 KiB		194 Bytes	2024-4-13 11:40:52
AC	不怎么聪明的家伙 (贺俊楠)	36ms	764 KiB		259 Bytes	2024-2-25 11:04:28
AC	jdy	36ms	532 KiB		247 Bytes	2024-3-6 16:54:44
AC	yanyuhan	36ms	764 KiB		191 Bytes	2024-3-2 9:00:48
AC	chen (peter)	52ms	440 KiB		364 Bytes	2022-12-31 16:37:28
AC	时代2校-程俊燃 (chengjunran)	58ms	440 KiB		325 Bytes	2023-4-22 18:19:35
AC	梨冻亿 (wiueh)	114ms	3.9 MiB	Python 3	182 Bytes	2022-1-23 20:05:24