四叶玫瑰数

状态	递交者	时间	内存	语言	代码	递交时间
AC	ylc	15ms	384 KiB		348 Bytes	2023-3-12 9:05:06
AC	Tender. (05c05-zhou)	15ms	460 KiB		314 Bytes	2022-10-17 20:28:11
AC	yanglang	15ms	384 KiB		306 Bytes	2022-10-21 23:25:51
AC	牟淳雅	15ms	7.2 MiB		407 Bytes	2023-6-10 19:51:19
AC	huanglu	15ms	7 MiB		335 Bytes	2023-7-15 16:00:44
AC	周米骐 (zsb)	15ms	6.8 MiB		393 Bytes	2023-11-1 11:52:59
AC	zcx	15ms	384 KiB		294 Bytes	2022-10-25 20:27:00
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		435 Bytes	2022-10-23 14:54:20
AC	新壹街-王俊博 (王俊博)	15ms	7.1 MiB	C++98	310 Bytes	2024-6-16 11:28:31
AC	cupy战士 (05c05-dkf)	15ms	6.9 MiB		359 Bytes	2023-9-24 11:33:11
AC	赵彬鸿	15ms	444 KiB		340 Bytes	2022-8-13 10:19:24
AC	爱琴海校区-胡靖欢 (胡靖欢1)	15ms	6.7 MiB		320 Bytes	2023-6-8 18:58:41
AC	火星伞宾——刘晏恺 (刘晏恺)	15ms	6.9 MiB		318 Bytes	2023-7-23 14:31:49
AC	colin1112 (墙凌可)	15ms	6.7 MiB		333 Bytes	2023-8-27 11:19:29
AC	谭懿轩 (yanyixuan)	15ms	512 KiB		321 Bytes	2022-2-15 14:16:34
AC	言年想摆烂~	15ms	6.8 MiB		353 Bytes	2023-6-11 8:30:10
AC	陈骏逸 (chenjunyi)	15ms	420 KiB		400 Bytes	2022-7-13 20:18:15
AC	李旻轩	15ms	384 KiB		488 Bytes	2023-3-25 11:30:59
AC	时代2校-程俊燃 (chengjunran)	15ms	6.9 MiB		325 Bytes	2023-7-25 16:33:58
AC	chen (peter)	15ms	436 KiB		321 Bytes	2022-7-19 11:13:43
AC	Jack	15ms	384 KiB		430 Bytes	2022-8-24 17:51:32
AC	xflt_dyp	15ms	6.9 MiB		462 Bytes	2023-7-22 16:33:23
AC	zjm	15ms	384 KiB		368 Bytes	2022-11-27 14:53:52
AC	王玺懿 (wxy)	15ms	384 KiB		274 Bytes	2022-8-7 12:06:49
AC	罗傲晴	15ms	392 KiB		368 Bytes	2023-3-15 20:27:35
AC	时代1校-杨宇轩 (杨宇轩)	15ms	6.9 MiB		360 Bytes	2023-8-21 14:10:54
AC	新壹街-王俊博 (王俊博)	15ms	7 MiB	C++98	310 Bytes	2024-6-8 14:37:20
AC	tyx_9192596	15ms	512 KiB		285 Bytes	2023-3-17 18:38:57
AC	奇怪的正义人！ (leweiqi)	15ms	512 KiB		349 Bytes	2023-3-14 20:07:17
AC	时代2校-程俊燃 (chengjunran)	15ms	6.9 MiB		325 Bytes	2023-8-17 20:23:11
AC	陈雨泽1	15ms	7 MiB		349 Bytes	2023-6-29 11:19:25
AC	zzzrrrxxx	15ms	6.9 MiB		322 Bytes	2023-7-16 11:34:35
AC	叶哲宇 (yzy)	15ms	8.1 MiB		302 Bytes	2023-8-22 17:12:42
AC	陈诺	15ms	7 MiB		297 Bytes	2023-12-23 19:44:31
AC	拥抱幸福小熊(吴沛篪)	15ms	7.3 MiB		375 Bytes	2023-11-11 11:20:43
AC	soha (武夷岩)	15ms	512 KiB		370 Bytes	2022-9-27 18:22:00
AC	sb (linjiayu23010)	15ms	6.7 MiB		364 Bytes	2023-6-8 18:31:03
AC	小忙果 (王昱杰)	15ms	6.9 MiB		318 Bytes	2023-7-20 8:45:10
AC	印昭旭（412） (印昭旭)	15ms	6.8 MiB		306 Bytes	2023-6-28 15:20:20
AC	坤坤荔枝小黑子 (zhonghaotian22006)	15ms	7.1 MiB		365 Bytes	2023-12-25 18:55:51
AC	张祖名	15ms	6.8 MiB	C++98(O2)	373 Bytes	2024-8-11 15:54:02
AC	葛琮扬	15ms	6.9 MiB		332 Bytes	2023-8-4 14:06:35
AC	tyx_9192596	15ms	6.8 MiB		285 Bytes	2023-6-21 18:32:20
AC	新壹街.曾祥睿 (zxr)	15ms	6.7 MiB		400 Bytes	2023-8-30 16:21:29
AC	新壹街校区--税崇峻 (税崇峻)	15ms	6.9 MiB		270 Bytes	2023-8-8 15:18:39
AC	新壹街陈科言 (cky)	16ms	7 MiB		667 Bytes	2023-7-20 11:48:10
AC	我很6 (zjj22031)	16ms	384 KiB		300 Bytes	2022-12-1 13:27:21
AC	贾博涵	16ms	6.8 MiB		298 Bytes	2023-11-8 11:30:22
AC	zvt_132 (任子轩)	16ms	6.9 MiB		332 Bytes	2023-7-14 12:17:46
AC	言年想摆烂~	16ms	6.8 MiB		353 Bytes	2023-6-11 8:14:28
AC	UsMt1 (jiangyuan)	16ms	6.9 MiB		342 Bytes	2023-7-22 22:15:24
AC	ganlin1	16ms	7.2 MiB		271 Bytes	2023-7-14 16:01:58
AC	wuqilin	16ms	6.8 MiB		300 Bytes	2023-7-6 23:08:36
AC	曲奇饼干	16ms	6.8 MiB		423 Bytes	2023-6-28 14:40:05
AC	黄立信	16ms	7 MiB		458 Bytes	2024-1-11 19:32:11
AC	刘致言	16ms	436 KiB		350 Bytes	2023-3-11 9:26:42
AC	罗翌珂 (dangdang)	16ms	436 KiB		371 Bytes	2022-8-27 10:43:52
AC	colin1112 (墙凌可)	16ms	436 KiB		344 Bytes	2023-1-22 12:33:55
AC	LittleHair	16ms	7 MiB		378 Bytes	2023-12-23 13:27:02
AC	三差学生(尘埃蓝莓) (白佳睿)	16ms	6.9 MiB		443 Bytes	2023-8-13 11:10:24
AC	我推的乱破 (贺俊楠)	16ms	6.8 MiB		339 Bytes	2023-6-7 19:29:34
AC	周琪渃	16ms	388 KiB		470 Bytes	2022-12-12 17:10:43
AC	郑岐蔚	16ms	6.9 MiB		369 Bytes	2023-6-9 19:44:48
AC	黄诗童 (hst01)	16ms	6.5 MiB		431 Bytes	2023-6-3 20:01:22
AC	scallway	16ms	392 KiB		370 Bytes	2022-9-24 17:28:14
AC	杨瀚霖 (yanghanlin)	16ms	6.8 MiB		450 Bytes	2023-6-9 20:00:19
AC	胡唯轶	16ms	7.3 MiB		544 Bytes	2024-1-17 19:25:20
AC	龙猫	17ms	7.2 MiB		316 Bytes	2023-7-10 19:26:55
AC	郑岐蔚	17ms	6.9 MiB		369 Bytes	2023-6-9 19:44:41
AC	邹曜丞 (13983097018)	17ms	6.9 MiB		510 Bytes	2023-7-23 16:11:43
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	17ms	512 KiB		401 Bytes	2023-1-14 16:58:17
AC	wzzjnb2012	17ms	436 KiB		444 Bytes	2022-9-29 21:11:55
AC	周米骐 (zsb)	17ms	7.1 MiB		393 Bytes	2023-12-27 20:27:32
AC	22029-lyh	17ms	6.9 MiB		336 Bytes	2023-7-23 17:03:33
AC	马浩宸 (mhc06)	17ms	6.8 MiB		345 Bytes	2023-8-23 16:48:52
AC	邵冠铖 (shaoguancheng22031)	17ms	512 KiB		294 Bytes	2022-11-27 12:06:50
AC	yxj	17ms	436 KiB		314 Bytes	2022-10-20 15:37:16
AC	煞笔笔	18ms	8 MiB		296 Bytes	2023-7-2 17:36:59
AC	时代一校-赵彦博 (zyb)	18ms	7.3 MiB		345 Bytes	2023-8-20 22:19:10
AC	罗莎莎	18ms	6.9 MiB		361 Bytes	2023-7-20 17:51:34
AC	wanghuaiying	18ms	7.5 MiB		302 Bytes	2023-11-11 11:30:04
AC	明轩 (吕同学)	18ms	7.3 MiB		465 Bytes	2024-1-22 11:08:24
AC	姚宏逸	18ms	7.1 MiB		452 Bytes	2023-11-12 16:16:49
AC	时代一校-赵彦博 (zyb)	18ms	6.8 MiB		365 Bytes	2023-8-23 16:42:23
AC	22029-lyh	19ms	6.3 MiB		336 Bytes	2023-11-19 10:03:03
AC	袁伟宸23025	19ms	7.3 MiB		315 Bytes	2024-1-17 19:24:31
AC	我是大傻逼，也是猪🐖。 (zhangshuhan)	21ms	7.3 MiB		303 Bytes	2024-1-17 19:33:35
AC	何昊宇 (22016-hhy)	22ms	7.1 MiB		444 Bytes	2024-1-17 18:43:17
AC	何镇西1	22ms	7 MiB		347 Bytes	2024-1-14 13:18:08
AC	许律天	23ms	7 MiB		310 Bytes	2023-12-7 19:46:40
AC	贾博涵	24ms	6.8 MiB		377 Bytes	2023-11-21 21:21:21
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	24ms	6.3 MiB		354 Bytes	2023-11-19 9:57:02
AC	暗蛆突围 (lzh)	25ms	7 MiB		415 Bytes	2023-12-28 18:13:52
AC	whj	25ms	7.2 MiB		286 Bytes	2024-1-21 11:21:32
AC	江科毅 (jky)	26ms	392 KiB		287 Bytes	2023-5-31 19:10:26
AC	zhangluyang	26ms	7.3 MiB		295 Bytes	2024-1-17 19:32:11
AC	王晴萱	26ms	7 MiB		304 Bytes	2023-11-11 12:04:42
AC	傀儡师 (zhujingen)	27ms	7.3 MiB		322 Bytes	2024-1-17 19:25:21
AC	zzzrrrxxx	27ms	7.1 MiB		322 Bytes	2023-12-17 17:33:24
AC	e^(i×π)+1=0	28ms	7.1 MiB		214 Bytes	2024-1-23 17:52:55