八进制和十六进制

状态	递交者	时间	内存	语言	代码	递交时间
AC	时代二校-焦雨齐 (Angel)	13ms	6.9 MiB	C++11	708 Bytes	2024-8-19 19:50:51
AC	李山水	13ms	420 KiB		200 Bytes	2022-2-19 10:55:06
AC	e^(i×π)+1=0	13ms	6.7 MiB		124 Bytes	2023-8-29 14:12:28
AC	SYC0226	13ms	384 KiB		144 Bytes	2022-1-2 13:11:05
AC	朱老师 (zyp)	13ms	512 KiB		403 Bytes	2022-7-25 17:12:25
AC	yu (赵子瑜)	13ms	440 KiB		589 Bytes	2022-3-1 19:07:55
AC	贾博涵	13ms	6.8 MiB		560 Bytes	2023-11-1 13:50:14
AC	wangjun	13ms	6.8 MiB		472 Bytes	2023-11-8 9:58:22
AC	zzy	13ms	452 KiB		547 Bytes	2023-4-13 20:27:48
AC	陈骏逸 (chenjunyi)	13ms	440 KiB		626 Bytes	2022-8-11 15:45:07
AC	ycy	13ms	512 KiB		139 Bytes	2023-2-19 15:11:04
AC	张子扬	13ms	420 KiB		172 Bytes	2022-3-1 21:35:34
AC	zjz	13ms	444 KiB		557 Bytes	2022-3-20 21:19:47
AC	dyp (hhy)	13ms	6.9 MiB		249 Bytes	2023-7-18 14:28:54
AC	新壹街——陈学彬 (BUG)	13ms	7.1 MiB		420 Bytes	2023-7-9 11:22:14
AC	zzl	13ms	6.8 MiB		416 Bytes	2023-11-6 20:49:58
AC	无尽的想象 (谭仕高)	13ms	512 KiB		753 Bytes	2022-7-12 16:52:41
AC	RanHao	13ms	6.9 MiB		150 Bytes	2023-7-16 10:21:17
AC	bvvd	13ms	6.7 MiB	C++98	555 Bytes	2024-8-2 17:23:23
AC	余晨浩 (yuchenhao)	13ms	384 KiB		145 Bytes	2023-5-28 10:54:58
AC	芒苒忧 (廖迦南)	13ms	512 KiB		153 Bytes	2022-1-25 14:42:12
AC	坤坤荔枝小黑子 (zhonghaotian22006)	13ms	384 KiB		414 Bytes	2022-11-17 19:36:36
AC	张景豪	13ms	7 MiB		414 Bytes	2023-6-29 20:35:55
AC	UsMt1 (jiangyuan)	13ms	6.9 MiB		646 Bytes	2023-7-27 10:13:14
AC	周琪渃	13ms	384 KiB		1.2 KiB	2023-3-9 20:50:24
AC	牟淳雅	13ms	6.8 MiB		518 Bytes	2023-7-18 21:12:07
AC	新壹街校区-陈峻熙 (陈峻熙)	13ms	7.2 MiB		547 Bytes	2023-10-28 11:31:46
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)	13ms	6.9 MiB		159 Bytes	2023-7-25 20:57:27
AC	朱老师 (zyp)	13ms	408 KiB		678 Bytes	2022-12-25 10:54:57
AC	杨坤霖 (steven)	13ms	384 KiB		134 Bytes	2023-1-10 17:26:15
AC	三差学生 (尘埃蓝莓)	13ms	6.9 MiB		475 Bytes	2023-7-8 11:56:50
AC	tyx_9192596	13ms	512 KiB		119 Bytes	2023-3-17 11:57:49
AC	yang	13ms	444 KiB		765 Bytes	2022-8-14 15:34:45
AC	maobohan	13ms	7.1 MiB		446 Bytes	2023-7-2 9:25:51
AC	司雨来 (siyulai)	13ms	440 KiB		601 Bytes	2022-10-6 17:46:42
AC	tsc_ (杨悦堃)	14ms	440 KiB		642 Bytes	2023-4-30 11:03:47
AC	Aphrode	14ms	6.8 MiB		201 Bytes	2023-6-23 13:46:19
AC	杨浩灵 (金坷拉)	14ms	7.1 MiB		627 Bytes	2023-7-20 16:54:00
AC	何定谦 (hdq)	14ms	7.1 MiB		609 Bytes	2023-7-6 11:03:11
AC	周米骐 (zsb)	14ms	6.8 MiB		352 Bytes	2023-10-7 20:42:21
AC	zjm	14ms	440 KiB		456 Bytes	2022-12-25 11:08:39
AC	时代二校+马嘉宸 (majiachen)	14ms	6.9 MiB		417 Bytes	2023-7-8 20:54:56
AC	hyh22031	14ms	384 KiB		415 Bytes	2022-12-25 10:58:51
AC	新壹街罗田雨 (罗田雨29)	14ms	6.9 MiB		132 Bytes	2023-8-11 14:52:31
AC	周琪渃	14ms	388 KiB		1.2 KiB	2023-3-9 20:50:39
AC	不怎么聪明的家伙 (贺俊楠)	14ms	6.8 MiB		127 Bytes	2023-6-18 17:10:02
AC	不怎么聪明的家伙 (贺俊楠)	14ms	6.8 MiB		127 Bytes	2023-6-18 17:09:46
AC	一片落叶 (yeyuhao)	14ms	6.7 MiB		159 Bytes	2023-8-24 14:55:49
AC	三差学生(尘埃蓝莓) (白佳睿)	14ms	8.4 MiB		385 Bytes	2023-7-10 17:59:35
AC	不怎么聪明的家伙 (贺俊楠)	14ms	6.8 MiB		127 Bytes	2023-6-18 17:09:37
AC	11451254188 (22029-mjh)	14ms	6.9 MiB		169 Bytes	2023-7-26 11:40:09
AC	时代一校-曾科智 (曾科智)	14ms	512 KiB		472 Bytes	2023-2-25 19:16:30
AC	zzzrrrxxx	14ms	7.1 MiB		566 Bytes	2023-11-26 19:05:10
AC	huanglu	14ms	6.9 MiB		123 Bytes	2023-7-15 13:50:38
AC	新壹街陈科言 (cky)	14ms	7.1 MiB		268 Bytes	2023-7-20 11:10:20
AC	林子沫awa (linziyue)	14ms	448 KiB		159 Bytes	2023-3-16 22:32:10
AC	德克萨斯做的到吗 (liyangbao)	14ms	452 KiB		640 Bytes	2022-11-5 23:10:26
AC	朱老师 (zyp)	14ms	440 KiB		494 Bytes	2022-12-25 10:22:12
AC	Tender. (05c05-zhou)	14ms	452 KiB		124 Bytes	2022-9-25 14:16:27
AC	漆星语 (qixingyu)	14ms	7.2 MiB		362 Bytes	2023-7-3 9:35:43
AC	缥 (王硕2012)	15ms	512 KiB		570 Bytes	2022-12-25 10:56:20
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	15ms	7.1 MiB		512 Bytes	2023-12-3 16:35:17
AC	chaikexu	15ms	384 KiB		514 Bytes	2022-10-28 21:13:18
AC	葛琮扬	15ms	6.9 MiB		130 Bytes	2023-8-2 15:47:49
AC	源著校区-宋昊成 (马冬梅)	15ms	512 KiB		415 Bytes	2023-2-25 17:04:45
AC	xflt_dyp	15ms	6.9 MiB		400 Bytes	2023-7-22 15:35:58
AC	lihaoyi	15ms	436 KiB		713 Bytes	2022-12-27 18:49:41
AC	sb (吴振宇)	15ms	6.9 MiB		259 Bytes	2023-11-9 22:36:28
AC	不怎么聪明的家伙 (贺俊楠)	15ms	6.8 MiB		127 Bytes	2023-6-18 17:09:54
AC	朱老师 (zyp)	15ms	436 KiB		487 Bytes	2022-11-17 19:05:18
AC	guozuming	15ms	512 KiB		495 Bytes	2022-12-11 15:32:09
AC	zcx	15ms	6.7 MiB		169 Bytes	2023-8-23 14:35:42
AC	稻妻第一深情 (喝酒の吟游诗人)	15ms	512 KiB		1.2 KiB	2023-1-10 10:54:40
AC	yanglang	15ms	476 KiB		409 Bytes	2022-10-16 12:36:28
AC	Nico	15ms	436 KiB		517 Bytes	2022-12-23 16:48:03
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	15ms	440 KiB		574 Bytes	2023-1-18 15:03:11
AC	CK (李弘毅)	16ms	448 KiB		431 Bytes	2022-11-11 18:46:18
AC	时代一校-赵彦博 (zyb)	16ms	7.1 MiB		131 Bytes	2023-8-16 14:15:00
AC	杨坤霖 (steven)	16ms	436 KiB		134 Bytes	2023-1-10 17:26:14
AC	(金沙天街)严皓月 (严皓月)	16ms	6.9 MiB		400 Bytes	2023-7-22 10:49:21
AC	zyl	16ms	7.3 MiB		336 Bytes	2024-1-3 16:13:55
AC	时代一校-赵彦博 (zyb)	16ms	7.1 MiB		131 Bytes	2023-7-15 10:55:49
AC	colin1112 (墙凌可)	18ms	832 KiB		470 Bytes	2023-1-22 12:23:44
AC	蒲梓勋 (puzixun)	20ms	512 KiB		940 Bytes	2022-11-14 22:16:12
AC	yxj	20ms	512 KiB		579 Bytes	2022-10-20 15:03:04
AC	没有此人 (akm)	22ms	7 MiB		986 Bytes	2023-12-8 17:11:15
AC	李睿18	24ms	7 MiB		482 Bytes	2023-12-7 16:39:33
AC	¿¿¿??? (李睿瞳)	54ms	760 KiB		152 Bytes	2024-2-4 16:45:26
AC	游智棋	55ms	772 KiB		130 Bytes	2024-3-25 20:43:34
AC	毕浩宇 (bihaoyu)	58ms	764 KiB		395 Bytes	2024-4-11 11:39:26
AC	金沙-文豪 (wenhao)	59ms	536 KiB		317 Bytes	2024-4-6 15:44:24
AC	0721 (龙浩恩)	60ms	548 KiB	C++11	139 Bytes	2024-9-7 10:07:16
AC	时代校区-孔令皓 (konglinghao)	60ms	548 KiB		493 Bytes	2024-4-9 17:29:08
AC	yuchenyi23017	60ms	532 KiB		423 Bytes	2024-1-28 13:23:02
AC	明轩 (吕同学)	60ms	764 KiB		360 Bytes	2024-2-23 20:06:18
AC	阮 (媚狐不吃道旁李)	61ms	532 KiB		178 Bytes	2024-2-24 15:33:30
AC	wangzihang3	61ms	532 KiB		209 Bytes	2024-2-14 15:03:20
AC	赵奕铭	62ms	764 KiB		363 Bytes	2024-3-5 21:45:14
AC	tongxiao	62ms	768 KiB		410 Bytes	2024-3-21 19:58:19
AC	jdy	64ms	532 KiB		190 Bytes	2024-3-6 15:24:25