输出保留12位小数的浮点数

状态	递交者	时间	内存	语言	代码	递交时间
AC	赵沛喆	6ms	256 KiB		120 Bytes	2022-3-8 15:43:09
AC	1396013295	7ms	332 KiB		120 Bytes	2022-3-4 18:27:49
AC	汪致卉 (wangzh)	7ms	284 KiB		97 Bytes	2022-2-27 14:54:55
AC	杨坤霖 (steven)	7ms	260 KiB		108 Bytes	2023-1-19 16:52:09
AC	肖添宇	7ms	312 KiB		135 Bytes	2022-4-23 17:25:32
AC	杨坤霖 (steven)	8ms	256 KiB		108 Bytes	2023-1-19 16:52:10
AC	坤坤荔枝小黑子 (zhonghaotian22006)	12ms	384 KiB		124 Bytes	2022-7-4 10:17:16
AC	李树崑 (lishukun)	12ms	384 KiB		165 Bytes	2022-8-5 15:10:10
AC	草\|\|草 (陈星佑)	12ms	384 KiB		132 Bytes	2022-6-1 11:13:55
AC	林小博	13ms	384 KiB		150 Bytes	2022-5-19 21:11:50
AC	诸禹吉 (zhuyuji)	13ms	384 KiB		190 Bytes	2022-5-14 15:57:13
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	13ms	6.9 MiB		182 Bytes	2023-12-2 9:37:46
AC	TBB (杜昊燃)	13ms	432 KiB		129 Bytes	2022-4-9 23:07:23
AC	黄梓桐 (HuangZiTong)	13ms	384 KiB		113 Bytes	2022-6-23 19:19:57
AC	杨淇瑞 (杨淇瑞29)	13ms	7.2 MiB	C++98	123 Bytes	2024-5-15 20:41:09
AC	江子墨	13ms	7 MiB	C++98	120 Bytes	2024-6-27 10:05:16
AC	王祎辰 (wangyichen)	13ms	7.2 MiB	C++11	126 Bytes	2024-4-27 13:34:59
AC	赵泳鑫 (zhaoyongxin)	13ms	512 KiB		123 Bytes	2022-4-28 6:55:41
AC	樊竣熠 (lft1114)	13ms	436 KiB		122 Bytes	2022-3-7 20:18:55
AC	zhanghaoran	13ms	412 KiB		125 Bytes	2022-3-12 10:14:01
AC	徐子恩 (Cow)	13ms	444 KiB		144 Bytes	2022-3-10 19:45:06
AC	xiangsiyu	13ms	384 KiB		179 Bytes	2022-7-3 22:00:06
AC	草\|\|草 (陈星佑)	13ms	384 KiB		132 Bytes	2022-6-1 11:13:53
AC	huyinuo	13ms	392 KiB		120 Bytes	2022-5-31 22:19:25
AC	Tang	13ms	424 KiB		123 Bytes	2022-3-9 20:06:47
AC	11111	13ms	384 KiB		130 Bytes	2022-3-13 11:31:17
AC	LUKHE (LukeHu)	14ms	432 KiB		200 Bytes	2022-4-16 17:06:49
AC	姚宏逸	14ms	428 KiB		142 Bytes	2022-3-1 17:08:12
AC	姚宏逸	14ms	436 KiB		114 Bytes	2022-5-2 14:46:38
AC	luoluonuoya	14ms	512 KiB		221 Bytes	2022-5-8 15:13:53
AC	杜俊宏	14ms	512 KiB		130 Bytes	2022-6-9 19:09:41
AC	何锦宸熙	14ms	7.2 MiB	C++98	120 Bytes	2024-4-27 14:01:35
AC	高致远 (GZY)	14ms	440 KiB		136 Bytes	2023-2-12 20:31:13
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	14ms	436 KiB		123 Bytes	2022-11-23 18:04:40
AC	草\|\|草 (陈星佑)	14ms	392 KiB		132 Bytes	2022-6-1 11:13:55
AC	李彭宋代诗人 (ljy123456)	14ms	440 KiB		124 Bytes	2023-4-6 16:17:20
AC	源著校区-宋昊成 (马冬梅)	14ms	432 KiB		109 Bytes	2023-2-26 19:50:37
AC	高致远 (GZY)	14ms	384 KiB		144 Bytes	2022-3-12 9:00:56
AC	赵鑫宸 (xiaoxiao721)	14ms	436 KiB		150 Bytes	2022-3-12 16:55:08
AC	22016-lyj	14ms	392 KiB		130 Bytes	2022-11-24 16:09:58
AC	22029-lyh	14ms	432 KiB		128 Bytes	2022-11-23 17:20:29
AC	MoonLight ( aaa)	14ms	432 KiB		129 Bytes	2022-8-11 10:56:31
AC	ywh	14ms	436 KiB		136 Bytes	2022-6-25 13:52:02
AC	张瑞博	14ms	7.1 MiB	C++11	116 Bytes	2024-4-20 23:34:03
AC	希蒙 (zhengxingya)	14ms	6.8 MiB		209 Bytes	2023-10-18 17:21:44
AC	dmh (丁墨涵)	14ms	436 KiB		119 Bytes	2022-3-26 14:40:54
AC	王晨志 (wangchenzhi)	14ms	432 KiB		133 Bytes	2022-7-22 15:03:46
AC	周琪渃	14ms	436 KiB		121 Bytes	2023-3-5 12:21:00
AC	邹曜丞 (13983097018)	15ms	7 MiB		123 Bytes	2023-7-18 14:59:42
AC	Error404sans (焦阳浩云)	15ms	7.1 MiB		117 Bytes	2023-10-29 11:20:27
AC	庹仕杰	15ms	6.7 MiB		108 Bytes	2023-10-1 10:30:16
AC	疯神芭芭脱丝 (李卓修)	15ms	512 KiB		123 Bytes	2022-7-12 11:43:57
AC	colin1112 (墙凌可)	15ms	6.7 MiB		196 Bytes	2023-9-7 19:08:33
AC	我很6 (zjj22031)	15ms	448 KiB		119 Bytes	2022-11-24 13:27:11
AC	cupy战士 (05c05-dkf)	15ms	6.8 MiB		133 Bytes	2023-9-10 10:38:14
AC	22029-hqh	15ms	436 KiB		110 Bytes	2022-11-26 18:14:36
AC	11111	15ms	512 KiB		130 Bytes	2022-3-13 11:31:17
AC	RanHao	15ms	6.8 MiB		133 Bytes	2023-10-3 22:19:03
AC	Randy Marsh (杨子腾)	15ms	512 KiB		130 Bytes	2022-6-12 18:56:11
AC	许嘉恩 (xje22031)	15ms	436 KiB		119 Bytes	2022-11-25 18:30:43
AC	昌文迪 (05c05-cwd2)	15ms	512 KiB		117 Bytes	2022-11-26 16:37:21
AC	ttt123	15ms	384 KiB		120 Bytes	2022-11-25 19:09:54
AC	22029-lsl	15ms	392 KiB		113 Bytes	2022-11-25 19:10:00
AC	ttt123	15ms	384 KiB		125 Bytes	2022-11-25 19:11:49
AC	邵冠铖 (shaoguancheng22031)	15ms	512 KiB		110 Bytes	2022-11-23 20:10:19
AC	新壹街校区-杨轩懿 (杨轩懿1)	16ms	6.9 MiB		104 Bytes	2023-7-24 13:54:30
AC	UsMt1 (jiangyuan)	16ms	6.9 MiB		104 Bytes	2023-7-20 15:51:09
AC	zlx (xiao)	16ms	492 KiB		141 Bytes	2022-11-26 21:23:55
AC	缥 (王硕2012)	16ms	384 KiB		130 Bytes	2022-11-24 17:47:55
AC	杜是贤 (dushixian)	16ms	432 KiB		130 Bytes	2023-5-28 10:47:37
AC	yangbinyu	16ms	416 KiB		147 Bytes	2022-10-18 10:05:57
AC	马渝杭 (mayuhang)	16ms	436 KiB		117 Bytes	2023-3-6 19:19:25
AC	我推的乱破 (贺俊楠)	17ms	7 MiB		146 Bytes	2023-12-23 11:58:26
AC	陈家齐 (陈家齐1)	17ms	7.1 MiB		110 Bytes	2023-7-6 10:02:40
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	440 KiB		120 Bytes	2022-11-24 20:23:49
AC	11451254188 (22029-mjh)	18ms	420 KiB		112 Bytes	2022-11-25 18:28:13
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)	19ms	8.1 MiB		163 Bytes	2023-8-23 18:08:41
AC	22029-zjs	20ms	440 KiB		119 Bytes	2022-11-23 20:47:23
AC	cainuoyan	58ms	540 KiB		105 Bytes	2024-3-9 15:42:30
AC	时代一校-赵彦博 (zyb)	62ms	764 KiB		143 Bytes	2024-3-14 21:18:52
AC	赵奕铭	66ms	548 KiB		111 Bytes	2024-3-19 21:43:00
AC	唐一航	68ms	552 KiB	C++11	117 Bytes	2024-9-29 20:33:02
AC	梁家畅	69ms	540 KiB	C++11(O2)	128 Bytes	2024-11-23 19:57:00
AC	时代2校-程俊燃 (chengjunran)	70ms	764 KiB		117 Bytes	2024-1-31 16:36:50
AC	没有此人 (akm)	71ms	788 KiB		123 Bytes	2024-3-13 22:06:19
AC	马化腾 * 4 (zhanlan)	72ms	764 KiB	C++11	105 Bytes	2024-9-22 18:55:53
AC	梨冻亿 (wiueh)	196ms	3.9 MiB	Python 3	285 Bytes	2022-4-4 10:07:25
AC	火爆肥肠（杨弘毅） (火爆肥肠)	198ms	3.9 MiB	Python 3	34 Bytes	2022-2-27 11:54:34
AC	majinhui	206ms	4 MiB	Python 3	34 Bytes	2022-8-6 15:20:05
AC	爱琴海校区-刁钲洋 (刁钲洋)	220ms	3.9 MiB	Python 3	33 Bytes	2022-3-10 22:29:39