长方形周长（保留小数）

状态	递交者	时间	内存	语言	代码	递交时间
AC	hjy	5ms	8.2 MiB		123 Bytes	2023-6-30 9:39:00
AC	杨淇瑞 (杨淇瑞29)	5ms	6.7 MiB		146 Bytes	2023-9-19 20:48:28
AC	zcx	5ms	8.2 MiB		213 Bytes	2023-6-3 9:19:23
AC	amr (董子溪)	5ms	7 MiB	C++98	157 Bytes	2024-6-14 19:50:14
AC	李雨宸 (lyc)	5ms	8.2 MiB		131 Bytes	2022-7-27 8:35:09
AC	胡程禹	5ms	8.2 MiB		130 Bytes	2023-2-18 19:58:49
AC	kin of kin (jojo)	5ms	8.2 MiB		160 Bytes	2022-3-11 20:56:59
AC	余晨浩 (yuchenhao)	5ms	8.2 MiB		143 Bytes	2022-8-24 15:17:15
AC	zzy	5ms	8.2 MiB		133 Bytes	2022-10-25 19:52:32
AC	孙天豪 (AliceSteven)	5ms	8.2 MiB		159 Bytes	2022-2-27 14:21:29
AC	骏骏0712	5ms	8.2 MiB		165 Bytes	2022-4-9 11:12:56
AC	草\|\|草 (陈星佑)	5ms	8.2 MiB		142 Bytes	2022-4-23 10:47:14
AC	陈红恺 (chk)	5ms	8.2 MiB		141 Bytes	2022-5-27 19:08:20
AC	呵 (mohaoran)	5ms	8.2 MiB		122 Bytes	2022-8-27 22:28:41
AC	黄梓轩 (huangzixuan)	5ms	8.2 MiB		144 Bytes	2022-7-13 19:30:31
AC	张子扬	5ms	8.2 MiB		224 Bytes	2022-1-20 19:35:51
AC	LiXY	5ms	7 MiB	C++98(O2)	316 Bytes	2024-6-9 20:01:44
AC	杨朔	5ms	6.8 MiB		167 Bytes	2023-10-29 16:43:28
AC	Erin	5ms	7.2 MiB	C++98	157 Bytes	2024-5-1 10:07:24
AC	李谨严	5ms	8.2 MiB		166 Bytes	2022-9-12 17:04:44
AC	神印王座	5ms	8.2 MiB		171 Bytes	2022-9-24 16:16:44
AC	王康瑞	5ms	6.9 MiB		189 Bytes	2023-10-21 10:31:52
AC	龚信丞	5ms	8.2 MiB		253 Bytes	2023-4-29 22:01:37
AC	李禹衡 (liyuheng22006)	5ms	8.2 MiB		134 Bytes	2022-5-27 19:09:16
AC	陈嘉熠	5ms	8.2 MiB		175 Bytes	2022-11-27 16:57:36
AC	陈嘉熠	5ms	8.2 MiB		175 Bytes	2022-11-27 16:57:37
AC	雷承翰1	5ms	8.2 MiB		130 Bytes	2023-2-18 20:01:18
AC	炸鱼4000+ (dxc)	5ms	8.2 MiB		149 Bytes	2023-2-18 19:56:57
AC	陈嘉熠	5ms	8.2 MiB		175 Bytes	2022-11-27 16:57:36
AC	zzt	5ms	8.2 MiB		159 Bytes	2022-3-25 18:58:58
AC	56 (13883454928)	5ms	8.2 MiB		140 Bytes	2022-10-2 13:17:29
AC	Randy Marsh (杨子腾)	5ms	8.2 MiB		163 Bytes	2022-1-24 11:20:26
AC	余晨浩 (yuchenhao)	5ms	8.2 MiB		143 Bytes	2022-8-24 15:17:17
AC	杨子力	5ms	8.2 MiB		165 Bytes	2022-3-10 18:45:37
AC	xiejiachen	5ms	8.2 MiB		198 Bytes	2022-1-22 9:53:47
AC	叶雨昊 (yeyuhao22006)	5ms	8.2 MiB		133 Bytes	2023-2-9 17:14:31
AC	罗莎莎	5ms	8.2 MiB		156 Bytes	2022-9-18 11:48:41
AC	罗宇凡 (吴彦祖)	5ms	8.2 MiB		162 Bytes	2022-3-3 19:48:50
AC	爱琴海校区-王宥喆 (王宥喆)	5ms	8.2 MiB		146 Bytes	2023-7-5 20:15:50
AC	王泓涵 (whh)	5ms	8.2 MiB		148 Bytes	2022-6-19 11:36:53
AC	叶令子	5ms	8.2 MiB		123 Bytes	2023-8-16 21:30:18
AC	陈秋石	5ms	8.2 MiB		127 Bytes	2022-5-29 9:18:57
AC	fsx	5ms	6.7 MiB		126 Bytes	2023-9-10 11:04:42
AC	无尽的想象 (谭仕高)	5ms	8.2 MiB		155 Bytes	2022-8-22 14:48:08
AC	钟睿煊 (zhongruixuan)	5ms	8.2 MiB		134 Bytes	2023-5-7 17:55:22
AC	韦孟巡_1	5ms	8.2 MiB		137 Bytes	2023-6-4 17:28:49
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	5ms	8.2 MiB		146 Bytes	2022-5-21 13:47:31
AC	第五人格启动 (罗子键)	5ms	8.2 MiB		157 Bytes	2023-2-18 19:56:59
AC	zyl	5ms	6.8 MiB		206 Bytes	2023-10-26 22:03:02
AC	大马猴 (周琳竣)	5ms	8.1 MiB		158 Bytes	2023-8-1 19:47:49
AC	maomao	5ms	8.2 MiB		138 Bytes	2022-5-19 13:21:13
AC	ywh	5ms	8.2 MiB		159 Bytes	2022-1-23 15:21:54
AC	周琪渃	5ms	8.2 MiB		142 Bytes	2022-12-9 19:25:59
AC	胡益玮	5ms	7 MiB	C++11	160 Bytes	2024-8-25 11:59:59
AC	你猜呀	5ms	8.2 MiB		134 Bytes	2023-3-5 15:25:36
AC	zhangyouze (张佑泽)	5ms	8.2 MiB		142 Bytes	2023-2-26 17:30:37
AC	雷承翰 (雷承翰lch)	5ms	6.9 MiB	C++98	155 Bytes	2024-5-26 14:44:32
AC	苏信泽	5ms	8.2 MiB		118 Bytes	2023-2-18 19:55:05
AC	Ruler (05c35-hjs)	5ms	8.2 MiB		172 Bytes	2022-3-12 20:16:32
AC	罗翌珂 (dangdang)	5ms	8.1 MiB		165 Bytes	2022-11-17 21:38:27
AC	wangziji	5ms	8.2 MiB		135 Bytes	2022-11-3 19:33:47
AC	代尚函笛卡尔 (daishanghan)	5ms	8.2 MiB		136 Bytes	2022-8-22 15:25:55
AC	袁辰奕 (yuanchenyi11b)	5ms	8.2 MiB		128 Bytes	2022-7-18 19:39:10
AC	张梓辰 (DiaoDesi屌德斯)	5ms	8.2 MiB		152 Bytes	2022-5-19 20:20:35
AC	CPL	5ms	8.2 MiB		157 Bytes	2023-2-16 19:27:38
AC	余晨浩 (yuchenhao)	5ms	8.2 MiB		143 Bytes	2022-8-24 15:17:16
AC	张景豪	5ms	8.2 MiB		136 Bytes	2023-6-29 20:48:05
AC	陈嘉熠	5ms	8.2 MiB		175 Bytes	2022-11-27 16:57:44
AC	六 (江智昕)	5ms	8.2 MiB		148 Bytes	2023-2-23 21:06:50
AC	CYT	5ms	8.2 MiB		128 Bytes	2022-12-1 20:31:03
AC	22029-hqh	5ms	8.2 MiB		132 Bytes	2023-1-10 11:27:34
AC	龙湖源著校区-王子涵 (王子涵)	5ms	8.2 MiB		144 Bytes	2023-7-10 15:00:54
AC	除了我全部人都是SB (车涌樯)	5ms	8.2 MiB		123 Bytes	2023-7-13 17:35:16
AC	jighghjkfkhfdhdfdfdsfsdfsafvmnkbnkbmnlvnmkbvnvb;,.m;,;.;,;kbvlmkbnlmkblnvkmlbnkmlbvkmlbvklmbkmlkblmbnm;,l.,.;,'.,';.[',;.[,kjkoihgfhfgiohifgohifgohiofgihgofhiofgihofgihofgihofgiho;''[;.',m;.',m.;',.;'m,.;';'cv;x'cb'cx;b'cv;b'xc;b'c;b'cvbvc.'bv.//,/vb./vcb./cvbv,c.b,cv.,b.cv,b.vc,bg;hgl;hgl;hg;h;hfg;hl;lf;l;lxc;cln;bvln;vcln;vnl;vbl;vbln;vlv;blnvb;plnp;lplhfljpjh;nlvb;nv;bn;vcvl;nlv;nlv;g;hjhchl;ghfghl;fghl;ltlh;l;hlf;lg;bnlc;;nlv;nbv;nbv;nvb;nlvcnl;xc;blxcb;ll;hg;lhgl;dfl;t;ldy;l;lyl;rewlt493;l;dl;dsflg;lsdlpbpcxobpocvbpopopopreopotpreotertertretert (litingxu)	5ms	8.2 MiB		145 Bytes	2023-5-7 17:53:27
AC	德克萨斯做的到吗 (liyangbao)	5ms	8.2 MiB		154 Bytes	2022-10-24 17:11:08
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)	5ms	8.2 MiB		140 Bytes	2023-5-27 10:24:39
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	5ms	6.7 MiB		175 Bytes	2023-10-1 14:23:21
AC	yu (赵子瑜)	5ms	8.2 MiB		132 Bytes	2022-2-22 19:59:21
AC	南坪校区-郑力博 (zhenglibo23003)	5ms	8.2 MiB		133 Bytes	2023-3-4 17:13:25
AC	林昱霏	5ms	8.1 MiB		122 Bytes	2022-8-18 13:50:46
AC	苏晨懿	5ms	8.2 MiB		126 Bytes	2023-7-3 9:51:52
AC	WangXi	5ms	8.2 MiB		124 Bytes	2022-9-24 17:19:34
AC	JIANGYUNHAN	5ms	8.2 MiB		130 Bytes	2022-4-16 21:18:41
AC	李施城	5ms	8.2 MiB		112 Bytes	2023-2-11 15:40:49
AC	司雨来 (siyulai)	5ms	8.2 MiB		125 Bytes	2022-10-6 16:20:28
AC	郭征华第一忠实粉丝	5ms	8.2 MiB		150 Bytes	2022-7-22 21:15:58
AC	SB (mfy01)	5ms	8.2 MiB		141 Bytes	2022-12-5 9:03:46
AC	赵彬鸿	5ms	8.2 MiB		135 Bytes	2022-8-12 14:29:13
AC	kql1	5ms	7.1 MiB	C++98	128 Bytes	2024-5-9 12:57:44
AC	dengduxi	5ms	8.2 MiB		141 Bytes	2022-10-23 18:23:26
AC	反恐俄蛋 (zhouyuhao)	5ms	8.2 MiB		122 Bytes	2022-9-16 18:54:34
AC	王泓涵 (whh)	5ms	8.2 MiB		148 Bytes	2022-7-9 14:02:52
AC	dengyongjia	5ms	8.2 MiB		132 Bytes	2023-3-15 20:40:04
AC	river	5ms	8.2 MiB		146 Bytes	2022-4-4 21:42:53
AC	yh1	5ms	8.2 MiB		154 Bytes	2023-5-17 22:24:35
AC	邹曜丞 (13983097018)	5ms	8.2 MiB		139 Bytes	2023-4-2 11:12:21
AC	李山水	5ms	8.2 MiB		141 Bytes	2022-1-19 18:05:41
AC	坤坤荔枝小黑子 (zhonghaotian22006)	5ms	8.2 MiB		136 Bytes	2022-6-26 18:36:03
AC	余晨浩 (yuchenhao)	5ms	8.2 MiB		143 Bytes	2022-8-24 15:17:18
AC	22029-hqh	5ms	8.2 MiB		132 Bytes	2023-1-10 11:27:24