希蒙的等式计算

状态	递交者	时间	内存	语言	代码	递交时间
AC	赵沛喆	6ms	256 KiB		155 Bytes	2022-3-27 11:20:37
AC	黄梓桐 (HuangZiTong)	12ms	384 KiB		166 Bytes	2022-8-3 16:20:26
AC	李嘉瑞	12ms	392 KiB		244 Bytes	2022-5-7 21:24:51
AC	ywh	12ms	392 KiB		219 Bytes	2022-1-24 19:39:55
AC	杜俊宏	12ms	384 KiB		205 Bytes	2022-5-15 16:49:38
AC	tad (OP AI)	13ms	6.7 MiB	C++11	184 Bytes	2024-7-4 18:02:54
AC	时代一校林星宇 (lxy)	13ms	392 KiB		373 Bytes	2023-4-23 22:54:58
AC	王晨志 (wangchenzhi)	13ms	424 KiB		234 Bytes	2022-6-18 4:50:30
AC	梨冻亿 (wiueh)	13ms	384 KiB		175 Bytes	2022-1-23 18:06:16
AC	姚宏逸	13ms	384 KiB		146 Bytes	2022-5-30 22:40:42
AC	时代一校 - 冯隆浩 (冯隆浩)	13ms	384 KiB		163 Bytes	2022-7-2 19:33:48
AC	赵泳鑫 (zhaoyongxin)	13ms	384 KiB		272 Bytes	2022-3-31 19:33:41
AC	zhangyh (张育菡)	13ms	392 KiB		223 Bytes	2022-6-13 22:05:57
AC	ycy	13ms	392 KiB		194 Bytes	2022-6-15 18:15:25
AC	1396013295	13ms	384 KiB		207 Bytes	2022-1-22 18:22:04
AC	叶哲宇 (yzy)	13ms	392 KiB		210 Bytes	2023-4-26 19:27:27
AC	Erin	13ms	7.1 MiB	C++98	158 Bytes	2024-5-5 18:38:31
AC	余彦瑞	13ms	392 KiB		164 Bytes	2022-4-3 9:41:15
AC	文硕 (文硕1)	13ms	444 KiB		272 Bytes	2022-7-12 11:39:48
AC	坤坤荔枝小黑子 (zhonghaotian22006)	13ms	392 KiB		187 Bytes	2022-9-11 16:18:57
AC	张梓辰 (DiaoDesi屌德斯)	13ms	392 KiB		172 Bytes	2022-5-21 10:22:50
AC	时代校区-孔令皓 (konglinghao)	13ms	7 MiB	C++98	455 Bytes	2024-5-19 16:46:41
AC	heyi	13ms	6.8 MiB	C++98(O2)	171 Bytes	2024-8-10 14:55:32
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	13ms	444 KiB		198 Bytes	2022-7-9 13:31:54
AC	徐子恩 (Cow)	13ms	384 KiB		181 Bytes	2022-3-20 9:27:11
AC	吴俊成 (wujuncheng)	13ms	440 KiB		161 Bytes	2022-7-11 10:17:05
AC	杜是贤 (dushixian)	13ms	512 KiB		159 Bytes	2022-6-12 10:11:42
AC	胡澜之 (666hlz666)	13ms	512 KiB		210 Bytes	2023-4-29 21:14:38
AC	源著校区-宋昊成 (马冬梅)	13ms	436 KiB		174 Bytes	2023-2-25 18:27:00
AC	呵呵呵 (陈思琦)	13ms	384 KiB		146 Bytes	2022-9-10 17:04:42
AC	shenyushun2	14ms	512 KiB		159 Bytes	2022-12-2 18:33:19
AC	阮 (媚狐不吃道旁李)	14ms	7 MiB	C++98	201 Bytes	2024-5-25 16:34:04
AC	zlx (xiao)	14ms	540 KiB		165 Bytes	2022-8-10 10:53:37
AC	谁陪訫牞（杀手） (22029-zys)	14ms	384 KiB		138 Bytes	2023-1-31 18:15:11
AC	CK (李弘毅)	14ms	384 KiB		167 Bytes	2022-9-10 14:59:55
AC	没有此人 (akm)	14ms	7.1 MiB	C++14	245 Bytes	2024-5-14 21:16:47
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	14ms	384 KiB		251 Bytes	2022-9-17 17:09:36
AC	wangzihang	14ms	512 KiB		146 Bytes	2022-8-5 10:03:54
AC	huyinuo	14ms	436 KiB		173 Bytes	2022-3-19 8:00:51
AC	张祖名	14ms	6.9 MiB	C++98(O2)	215 Bytes	2024-6-10 21:50:09
AC	李山水	14ms	384 KiB		189 Bytes	2022-2-26 13:49:27
AC	谢延灏 (xeiyanhao---a handsome boy)	14ms	392 KiB		156 Bytes	2022-4-7 15:29:09
AC	伍行念 (wuxingnian)	14ms	6.7 MiB		280 Bytes	2023-9-29 15:54:54
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)	14ms	512 KiB		194 Bytes	2023-5-16 20:01:53
AC	luoluonuoya	14ms	436 KiB		158 Bytes	2022-8-17 12:54:22
AC	SYC0226	14ms	392 KiB		179 Bytes	2022-3-20 13:15:58
AC	赵鑫宸 (xiaoxiao721)	14ms	512 KiB		310 Bytes	2022-2-26 18:12:28
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)	14ms	6.7 MiB		294 Bytes	2023-8-25 15:15:37
AC	姚宏逸	14ms	384 KiB		172 Bytes	2022-10-22 12:38:22
AC	向俊熙 (xiangjunxi23003)	14ms	384 KiB		161 Bytes	2023-3-22 17:55:35
AC	黄立信	14ms	6.8 MiB		222 Bytes	2023-10-15 20:33:53
AC	dmh (丁墨涵)	14ms	440 KiB		251 Bytes	2022-3-9 22:03:19
AC	maomao	14ms	428 KiB		153 Bytes	2022-5-26 13:39:12
AC	Yuan (Zongzi1)	14ms	6.7 MiB	C++17(O2)	182 Bytes	2024-7-18 11:35:17
AC	朱老师 (zyp)	14ms	512 KiB		173 Bytes	2022-8-6 19:39:16
AC	17779	14ms	432 KiB		149 Bytes	2022-3-15 20:30:45
AC	yanglang	14ms	432 KiB		159 Bytes	2023-2-11 22:23:52
AC	偽艺術家 (chenyanchi22006)	14ms	424 KiB		198 Bytes	2022-7-19 9:59:37
AC	Tender. (05c05-zhou)	14ms	440 KiB		196 Bytes	2023-2-17 20:11:39
AC	无尽的想象 (谭仕高)	14ms	444 KiB		159 Bytes	2022-7-29 14:26:35
AC	谭懿轩 (yanyixuan)	14ms	440 KiB		188 Bytes	2022-4-9 15:42:26
AC	颜梓宇	14ms	6.8 MiB		161 Bytes	2023-9-29 15:17:17
AC	qwerty	14ms	444 KiB		219 Bytes	2022-3-13 21:02:30
AC	xiongxinyao	14ms	428 KiB		146 Bytes	2023-1-31 9:42:33
AC	时代二校-焦雨齐 (Angel)	14ms	7.4 MiB		271 Bytes	2023-7-18 17:57:55
AC	肖添宇	14ms	392 KiB		188 Bytes	2022-1-22 20:04:00
AC	金沙—彭智宸 (彭智宸)	14ms	6.9 MiB		143 Bytes	2023-8-6 7:47:05
AC	李山水	14ms	424 KiB		189 Bytes	2022-2-26 13:49:27
AC	yuhaodi	14ms	428 KiB		258 Bytes	2023-5-15 17:29:52
AC	新壹街校区--税崇峻 (税崇峻)	14ms	6.8 MiB		189 Bytes	2023-8-22 17:45:23
AC	希蒙 (zhengxingya)	14ms	6.9 MiB		180 Bytes	2023-10-21 10:51:23
AC	谁陪訫牞（杀手） (22029-zys)	14ms	512 KiB		138 Bytes	2023-1-31 18:14:20
AC	郑尧 (zhengyao)	14ms	6.8 MiB		170 Bytes	2023-10-21 9:57:32
AC	邵冠铖 (shaoguancheng22031)	14ms	384 KiB		144 Bytes	2022-11-16 19:46:25
AC	疯神芭芭脱丝 (李卓修)	15ms	440 KiB		258 Bytes	2022-7-12 11:17:52
AC	zhoumingze23017	15ms	6.7 MiB		179 Bytes	2023-8-31 12:13:34
AC	黄梓轩 (huangzixuan)	15ms	392 KiB		177 Bytes	2022-9-10 17:05:14
AC	zzl	15ms	6.8 MiB		178 Bytes	2023-11-7 1:07:08
AC	时代一校-王宥量 (wangyouliang)	15ms	392 KiB		197 Bytes	2022-10-2 11:03:34
AC	陈杰晟	15ms	432 KiB		183 Bytes	2022-2-23 17:07:31
AC	wangruibo20xh	15ms	512 KiB		146 Bytes	2022-2-11 14:25:05
AC	杨瀚霖 (yanghanlin)	15ms	6.8 MiB		251 Bytes	2023-6-25 22:29:45
AC	lafuzbc	15ms	432 KiB		155 Bytes	2022-8-20 18:43:25
AC	scallway	15ms	512 KiB		165 Bytes	2022-9-10 13:07:59
AC	时代一校-赵彦博 (zyb)	15ms	7.8 MiB		251 Bytes	2023-8-25 17:10:35
AC	Nico	15ms	6.8 MiB		169 Bytes	2023-6-22 11:07:46
AC	姚宏逸	15ms	384 KiB		154 Bytes	2022-10-22 12:37:41
AC	蒲梓勋 (puzixun)	15ms	384 KiB		179 Bytes	2022-11-13 10:02:03
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	15ms	436 KiB		309 Bytes	2023-5-11 22:48:05
AC	中岛敦 (黄麒瑞)	15ms	6.8 MiB		171 Bytes	2023-10-2 13:02:31
AC	wangjun	15ms	6.5 MiB		160 Bytes	2023-11-19 11:19:29
AC	吃小孩的viv_	15ms	524 KiB		153 Bytes	2022-8-20 14:54:33
AC	关博源	15ms	440 KiB		185 Bytes	2023-4-15 10:52:02
AC	新壹街校区-周士杰 (zsj)	15ms	432 KiB		151 Bytes	2023-5-28 13:29:10
AC	胡宸华 (huchenhua)	15ms	436 KiB		166 Bytes	2022-11-26 23:34:49
AC	chen (peter)	15ms	428 KiB		288 Bytes	2022-8-27 19:31:56
AC	ganlin1	15ms	6.9 MiB		160 Bytes	2023-7-27 11:14:56
AC	周琪渃	15ms	384 KiB		177 Bytes	2022-12-24 17:14:48
AC	colin1112 (墙凌可)	15ms	448 KiB		157 Bytes	2023-3-11 15:09:18
AC	韩思辰 (hansichen)	15ms	392 KiB		274 Bytes	2022-12-18 15:57:57