二进制转十进制

状态	递交者	时间	内存	语言	代码	递交时间
AC	何星震 (Jacob)	14ms	388 KiB		288 Bytes	2022-8-28 11:34:17
AC	wangziji	14ms	384 KiB		270 Bytes	2022-8-28 11:42:36
AC	谢博文	14ms	412 KiB		237 Bytes	2022-2-19 10:21:33
AC	12345	14ms	384 KiB		268 Bytes	2022-2-19 15:16:28
AC	12345	14ms	384 KiB		268 Bytes	2022-2-19 15:16:32
AC	陈骏逸 (chenjunyi)	14ms	384 KiB		295 Bytes	2022-8-28 11:33:19
AC	时代1校-杨宇轩 (杨宇轩)	14ms	7.8 MiB		268 Bytes	2023-8-22 12:08:01
AC	陈杰晟	14ms	384 KiB		329 Bytes	2022-2-19 10:21:24
AC	AC[谭赫奕] (tanheyi)	14ms	388 KiB		195 Bytes	2023-4-21 18:13:24
AC	zhm123	14ms	392 KiB		249 Bytes	2022-12-23 16:24:01
AC	王晨志 (wangchenzhi)	14ms	436 KiB		570 Bytes	2022-2-26 16:48:02
AC	wangzihang	14ms	6.7 MiB		351 Bytes	2023-8-29 11:44:49
AC	12345	14ms	428 KiB		268 Bytes	2022-2-19 15:16:34
AC	22016-ggs	14ms	412 KiB		1.3 KiB	2022-9-11 11:23:39
AC	12345	14ms	384 KiB		268 Bytes	2022-2-19 15:16:36
AC	AC[谭赫奕] (tanheyi)	14ms	440 KiB		197 Bytes	2022-11-23 19:33:53
AC	罗伟杰 (13308275065)	14ms	436 KiB		263 Bytes	2022-7-12 16:01:47
AC	12345	14ms	384 KiB		268 Bytes	2022-2-19 15:16:27
AC	杨瀚霖 (yanghanlin)	14ms	384 KiB		272 Bytes	2023-2-25 11:07:49
AC	ttz	14ms	436 KiB		251 Bytes	2022-2-14 11:22:35
AC	yu (赵子瑜)	14ms	428 KiB		364 Bytes	2022-3-3 20:52:45
AC	yu (赵子瑜)	14ms	384 KiB		364 Bytes	2022-3-3 20:52:45
AC	(张洛诚)	14ms	384 KiB		233 Bytes	2023-5-3 15:55:06
AC	12345	14ms	392 KiB		268 Bytes	2022-2-19 15:16:27
AC	12345	15ms	404 KiB		268 Bytes	2022-2-19 15:16:23
AC	12345	15ms	384 KiB		268 Bytes	2022-2-19 15:16:27
AC	miku (阳沐珊)	15ms	6.7 MiB		294 Bytes	2023-9-15 19:58:38
AC	12345	15ms	392 KiB		268 Bytes	2022-2-19 15:16:27
AC	坤坤荔枝小黑子 (zhonghaotian22006)	15ms	440 KiB		197 Bytes	2022-11-23 16:08:53
AC	12345	15ms	384 KiB		268 Bytes	2022-2-19 15:16:32
AC	12345	15ms	384 KiB		268 Bytes	2022-2-19 15:16:23
AC	yu (赵子瑜)	15ms	384 KiB		364 Bytes	2022-3-3 20:52:44
AC	Tang	15ms	416 KiB		237 Bytes	2022-2-19 10:04:21
AC	zzy	15ms	512 KiB		342 Bytes	2023-4-13 20:29:00
AC	ttt123	15ms	512 KiB		250 Bytes	2023-3-25 23:13:40
AC	pandap&a王皓宸 (WANGHAOCHEN)	15ms	444 KiB		311 Bytes	2023-4-8 8:43:23
AC	12345	15ms	392 KiB		268 Bytes	2022-2-19 15:16:31
AC	江泽栋	15ms	6.7 MiB	C++11	190 Bytes	2024-8-1 10:56:43
AC	高彬月	15ms	6.9 MiB		250 Bytes	2023-11-19 15:55:57
AC	李卓燃 (李卓燃1)	15ms	436 KiB		194 Bytes	2023-2-28 22:40:48
AC	zyy	15ms	384 KiB		206 Bytes	2022-12-24 15:26:08
AC	林小博	15ms	436 KiB		263 Bytes	2023-2-11 9:28:59
AC	你猜呀	15ms	384 KiB		203 Bytes	2023-3-26 9:44:43
AC	pig (hezhihui)	15ms	6.8 MiB		275 Bytes	2023-10-26 18:28:13
AC	缥 (王硕2012)	15ms	384 KiB		248 Bytes	2022-12-25 11:32:06
AC	lihaoyi	15ms	384 KiB		279 Bytes	2022-12-27 18:55:47
AC	chaikexu	15ms	384 KiB		267 Bytes	2022-10-28 21:04:17
AC	SHY20091224	15ms	384 KiB		270 Bytes	2022-8-28 11:44:25
AC	ChongqingGroup (Donce)	15ms	6.9 MiB		264 Bytes	2023-11-19 15:54:44
AC	12345	15ms	384 KiB		268 Bytes	2022-2-19 15:16:24
AC	小土豆 (liuzirui2)	15ms	6.7 MiB		212 Bytes	2023-9-8 20:45:54
AC	12345	15ms	436 KiB		268 Bytes	2022-2-19 15:16:35
AC	程曦漫	15ms	6.9 MiB		238 Bytes	2023-11-19 15:56:31
AC	colin1112 (墙凌可)	15ms	444 KiB		253 Bytes	2023-4-20 11:52:28
AC	杨浩灵 (金坷拉)	15ms	512 KiB		210 Bytes	2023-1-4 23:20:59
AC	胡宸华 (huchenhua)	15ms	6.9 MiB		198 Bytes	2023-7-29 23:07:29
AC	漆星语 (qixingyu)	15ms	7.5 MiB		274 Bytes	2023-7-3 9:33:04
AC	ttt123	15ms	440 KiB		223 Bytes	2023-3-25 23:16:44
AC	yu (赵子瑜)	15ms	440 KiB		364 Bytes	2022-3-3 20:52:44
AC	lihaoyi	16ms	448 KiB		279 Bytes	2022-12-27 18:54:24
AC	22016-lyj	16ms	420 KiB		202 Bytes	2023-3-26 10:11:52
AC	maobohan	16ms	7.1 MiB		274 Bytes	2023-7-2 9:21:47
AC	12345	16ms	392 KiB		268 Bytes	2022-2-19 15:16:24
AC	wzzjnb2012	16ms	444 KiB		324 Bytes	2022-11-14 21:55:34
AC	周琪渃	16ms	392 KiB		204 Bytes	2022-12-10 19:06:36
AC	朱老师 (zyp)	16ms	384 KiB		279 Bytes	2022-12-25 11:27:27
AC	爱琴海校区-刁钲洋 (刁钲洋)	16ms	440 KiB		197 Bytes	2023-2-8 19:00:03
AC	章愉霖	16ms	392 KiB		235 Bytes	2022-12-24 15:30:46
AC	laiyouming22031	16ms	512 KiB		231 Bytes	2022-12-25 9:55:03
AC	zjm	16ms	520 KiB		251 Bytes	2022-12-25 11:40:40
AC	13883645777	16ms	512 KiB		227 Bytes	2022-12-24 15:24:33
AC	zhangzhimo	16ms	440 KiB		210 Bytes	2022-12-3 16:58:31
AC	Tender. (05c05-zhou)	16ms	6.7 MiB		282 Bytes	2023-8-25 11:14:10
AC	蒲梓勋 (puzixun)	16ms	488 KiB		261 Bytes	2022-8-28 11:26:29
AC	葛琮扬	16ms	6.9 MiB		261 Bytes	2023-8-2 15:36:09
AC	hyh22031	17ms	440 KiB		202 Bytes	2022-12-25 11:31:59
AC	hxb	17ms	6.8 MiB		226 Bytes	2023-6-24 19:04:24
AC	朱泽晟	17ms	424 KiB		237 Bytes	2022-8-30 16:48:42
AC	xyc (谢雨宸)	17ms	7.7 MiB		230 Bytes	2023-7-10 19:11:01
AC	13637782853	17ms	416 KiB		204 Bytes	2022-12-24 15:30:31
AC	三差学生(尘埃蓝莓) (白佳睿)	17ms	7.4 MiB		282 Bytes	2023-7-11 10:08:56
AC	我很6 (zjj22031)	17ms	436 KiB		237 Bytes	2022-12-25 11:26:45
AC	lvyanshan	18ms	7.3 MiB		376 Bytes	2024-1-6 19:13:41
AC	时代二校-焦雨齐 (Angel)	18ms	384 KiB		249 Bytes	2023-5-20 17:43:58
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)	18ms	6.9 MiB		268 Bytes	2023-8-10 10:28:18
AC	暗蛆突围 (lzh)	18ms	7.2 MiB		250 Bytes	2023-12-1 19:23:20
AC	(金沙天街)严皓月 (严皓月)	19ms	7.2 MiB		201 Bytes	2023-12-30 16:35:27
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	20ms	512 KiB		200 Bytes	2023-1-18 15:04:53
AC	刘煜轩	22ms	6.8 MiB		212 Bytes	2023-12-2 11:39:53
AC	易锦程 (sky)	23ms	7.1 MiB		239 Bytes	2023-12-6 22:45:44
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	23ms	7 MiB		227 Bytes	2023-12-9 0:08:23
AC	wangjun	24ms	6.8 MiB		205 Bytes	2023-11-26 17:51:12
AC	毕浩宇 (bihaoyu)	25ms	384 KiB		256 Bytes	2023-5-25 19:32:03
AC	xuniaoyin (徐袅音)	44ms	544 KiB		225 Bytes	2024-3-15 22:15:11
AC	许律天	61ms	536 KiB		206 Bytes	2024-2-29 21:54:49
AC	yuchenyi23017	62ms	536 KiB		225 Bytes	2024-1-28 15:44:19
AC	tongxiao	63ms	764 KiB		252 Bytes	2024-3-21 19:13:02
AC	张瑞博	65ms	552 KiB	C++11	236 Bytes	2024-8-31 16:29:56
AC	My name is Man (钟卓劭)	65ms	548 KiB		224 Bytes	2024-3-31 14:14:02
AC	杨哲羽	66ms	540 KiB		158 Bytes	2024-3-24 11:57:54