求阶乘

状态	递交者	时间	内存	语言	代码	递交时间
AC	熊奕博 (Mothefuck)	13ms	384 KiB		159 Bytes	2022-8-27 22:02:51
AC	dmh (丁墨涵)	13ms	384 KiB		139 Bytes	2022-1-25 21:20:30
AC	林小博	13ms	384 KiB		195 Bytes	2022-5-21 9:37:56
AC	renqiumo	13ms	384 KiB		154 Bytes	2022-2-20 16:28:44
AC	05c30-dyh	13ms	512 KiB		244 Bytes	2022-3-5 15:35:55
AC	🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕 (bro)	13ms	512 KiB		263 Bytes	2022-1-28 18:30:54
AC	侯治鋆	13ms	384 KiB		149 Bytes	2022-6-3 20:36:45
AC	xxteacher	13ms	424 KiB		321 Bytes	2022-2-10 10:44:54
AC	刘锦航	13ms	384 KiB		198 Bytes	2022-1-20 18:48:49
AC	江坤锜	13ms	392 KiB		182 Bytes	2023-3-4 20:15:32
AC	张峻尘 (zjc)	13ms	384 KiB		150 Bytes	2022-3-12 13:32:28
AC	罗宇凡 (吴彦祖)	13ms	416 KiB		147 Bytes	2022-3-6 19:47:34
AC	谭懿轩 (yanyixuan)	13ms	444 KiB		184 Bytes	2022-2-15 15:00:34
AC	李彦臻	13ms	6.8 MiB		167 Bytes	2023-9-29 14:59:24
AC	疯神芭芭脱丝 (李卓修)	13ms	384 KiB		169 Bytes	2022-1-24 17:27:17
AC	科比.布莱恩特 (董浩琰)	13ms	384 KiB		192 Bytes	2023-3-4 20:21:58
AC	贾鑫豪 (Mr Sam)	13ms	384 KiB		159 Bytes	2022-3-3 6:41:16
AC	05c35-hzh	13ms	496 KiB		242 Bytes	2022-3-11 17:09:52
AC	源著校区陈锐霖 (13983855850)	13ms	7 MiB	C++11	205 Bytes	2024-8-25 11:01:41
AC	刘锦航	13ms	384 KiB		198 Bytes	2022-1-20 18:49:40
AC	何洋名 (heyangming)	13ms	392 KiB		337 Bytes	2022-3-6 14:19:17
AC	余瀚	13ms	6.9 MiB	C++11	153 Bytes	2024-8-22 17:16:33
AC	时代2校-程俊燃 (chengjunran)	13ms	512 KiB		185 Bytes	2023-4-24 20:02:25
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	384 KiB		249 Bytes	2022-11-20 16:58:00
AC	雷诺伊尔 (崔金鹏)	13ms	6.7 MiB	C++98	184 Bytes	2024-7-17 9:57:50
AC	雷承翰1	13ms	428 KiB		175 Bytes	2023-3-4 20:21:25
AC	崔欧辰	13ms	6.9 MiB	C++11	198 Bytes	2024-8-17 9:56:15
AC	你爹 (郭铠嘉)	13ms	388 KiB		167 Bytes	2022-2-10 18:41:27
AC	张月恒	13ms	6.9 MiB	C++98(O2)	142 Bytes	2024-8-22 15:25:45
AC	阮 (媚狐不吃道旁李)	13ms	7.2 MiB	C++98	155 Bytes	2024-5-19 13:01:52
AC	无尽的想象 (谭仕高)	13ms	436 KiB		173 Bytes	2022-7-27 11:01:44
AC	zzzrrrxxx	13ms	6.9 MiB		174 Bytes	2023-7-16 11:59:50
AC	曹烜豪	13ms	384 KiB		160 Bytes	2023-3-4 20:18:38
AC	赵泳鑫 (zhaoyongxin)	13ms	384 KiB		236 Bytes	2022-3-14 19:06:13
AC	qinyi	13ms	440 KiB		194 Bytes	2022-3-12 16:44:32
AC	yuhaodi	13ms	512 KiB		186 Bytes	2023-5-11 15:52:26
AC	陈海骞 (chq)	13ms	444 KiB		201 Bytes	2022-3-19 11:18:09
AC	antaihe	13ms	384 KiB		179 Bytes	2022-9-12 16:57:55
AC	偽艺術家 (chenyanchi22006)	13ms	436 KiB		131 Bytes	2022-7-14 10:10:59
AC	kkksc03 (彭士锋)	13ms	384 KiB		298 Bytes	2022-3-11 19:01:52
AC	张瑞博	13ms	7 MiB	C++11	135 Bytes	2024-6-2 13:29:57
AC	10255	13ms	500 KiB		147 Bytes	2023-3-3 20:11:51
AC	shenyushun2	13ms	512 KiB		148 Bytes	2022-12-2 18:29:48
AC	刘锦航	13ms	384 KiB		198 Bytes	2022-1-20 18:48:56
AC	芒苒忧 (廖迦南)	13ms	384 KiB		232 Bytes	2022-1-26 10:30:17
AC	源著校区-宋昊成 (马冬梅)	13ms	512 KiB		177 Bytes	2023-2-25 18:15:21
AC	liulinqi1	14ms	392 KiB		158 Bytes	2022-10-15 17:37:33
AC	longhao	14ms	384 KiB		200 Bytes	2022-1-24 16:09:31
AC	李林峰 (金克拉)	14ms	436 KiB		162 Bytes	2023-2-18 9:48:39
AC	Accepted (周芷乐)	14ms	6.9 MiB	C++14	157 Bytes	2024-8-17 15:03:32
AC	傅博涛	14ms	412 KiB		129 Bytes	2022-1-30 17:22:52
AC	huyinuo	14ms	436 KiB		203 Bytes	2022-2-26 19:41:02
AC	时代一校 - 冯隆浩 (冯隆浩)	14ms	384 KiB		143 Bytes	2022-7-2 19:19:10
AC	chenyifei	14ms	384 KiB		218 Bytes	2022-1-20 19:03:02
AC	SMIK	14ms	392 KiB		199 Bytes	2022-1-26 17:46:05
AC	马渝杭 (mayuhang)	14ms	384 KiB		170 Bytes	2023-3-3 20:12:25
AC	徐子恩 (Cow)	14ms	512 KiB		238 Bytes	2022-7-7 20:07:12
AC	wangruibo20xh	14ms	392 KiB		132 Bytes	2022-1-20 21:10:32
AC	张瑞博	14ms	7.2 MiB	C++11	145 Bytes	2024-4-28 17:39:37
AC	ywh	14ms	384 KiB		164 Bytes	2022-2-19 11:18:24
AC	姚宏逸	14ms	392 KiB		163 Bytes	2022-3-3 19:22:39
AC	(张洛诚)	14ms	384 KiB		224 Bytes	2023-4-5 21:15:18
AC	三差学生 (尘埃蓝莓)	14ms	6.9 MiB		168 Bytes	2023-10-28 19:22:06
AC	肖艺勋2	14ms	7 MiB	C++17	175 Bytes	2024-8-24 15:48:06
AC	煞笔笔	14ms	6.9 MiB		137 Bytes	2023-12-1 20:43:07
AC	朱泽晟	14ms	392 KiB		279 Bytes	2022-2-13 10:58:16
AC	李山水	14ms	384 KiB		220 Bytes	2022-2-6 16:13:56
AC	^_^ (ctc)	14ms	440 KiB		147 Bytes	2022-12-7 11:05:46
AC	谢博文	14ms	392 KiB		163 Bytes	2022-2-13 10:56:41
AC	张瑞博	14ms	7.2 MiB	C++11	145 Bytes	2024-4-20 23:21:51
AC	刘锦航	14ms	384 KiB		198 Bytes	2022-1-20 18:48:56
AC	逄云皓	14ms	7 MiB	C++98	138 Bytes	2024-8-24 19:03:42
AC	jdy	14ms	392 KiB		196 Bytes	2022-1-20 18:53:02
AC	宋金龙 (songjl0421)	14ms	392 KiB		163 Bytes	2022-1-22 18:15:43
AC	颜梓宇	14ms	7 MiB		149 Bytes	2023-9-29 15:11:12
AC	郭益豪（帅哥） (guoyihao)	14ms	6.9 MiB	C++98	251 Bytes	2024-5-21 17:10:50
AC	***	14ms	436 KiB		230 Bytes	2023-3-2 15:26:57
AC	My name is Man (钟卓劭)	14ms	7 MiB	C++98	243 Bytes	2024-6-23 14:05:17
AC	第五人格启动 (罗子键)	14ms	384 KiB		222 Bytes	2023-3-4 20:20:00
AC	17779	14ms	384 KiB		167 Bytes	2022-3-8 20:10:28
AC	丛林 (conglin)	14ms	436 KiB		229 Bytes	2022-12-2 17:25:25
AC	王韵淮	14ms	392 KiB		124 Bytes	2022-6-5 9:01:15
AC	新壹街-曾浩坤 (曾浩坤)	14ms	6.8 MiB		159 Bytes	2023-9-30 10:41:28
AC	AI创客	14ms	7.2 MiB	C++98	234 Bytes	2024-6-22 11:18:00
AC	lafuzbc	14ms	444 KiB		153 Bytes	2022-8-20 18:40:37
AC	MoonLight ( aaa)	14ms	384 KiB		230 Bytes	2022-1-3 17:49:47
AC	呵呵呵 (陈思琦)	14ms	432 KiB		131 Bytes	2022-9-10 17:00:23
AC	Cristiano·Ronaldo (05c41-gmz)	14ms	512 KiB		503 Bytes	2022-7-27 13:41:00
AC	你猜呀	14ms	384 KiB		188 Bytes	2023-3-15 19:15:14
AC	第五人格启动 (罗子键)	14ms	384 KiB		222 Bytes	2023-3-4 20:20:00
AC	谭懿轩 (yanyixuan)	14ms	456 KiB		180 Bytes	2022-3-17 18:06:59
AC	况奕辛 (KYX_yyds)	14ms	480 KiB		263 Bytes	2022-2-25 20:22:52
AC	彭嘉豪 (pengjiahao)	14ms	440 KiB		154 Bytes	2022-7-28 10:27:42
AC	向俊熙 (xiangjunxi23003)	14ms	384 KiB		153 Bytes	2023-3-22 17:39:35
AC	时代一校林星宇 (lxy)	14ms	432 KiB		189 Bytes	2023-4-23 22:47:20
AC	hnd (陈皓洋)	14ms	436 KiB		313 Bytes	2022-8-27 11:35:22
AC	kapurua	14ms	6.7 MiB		219 Bytes	2023-9-24 16:21:34
AC	CK (李弘毅)	14ms	440 KiB		131 Bytes	2022-8-17 16:52:44
AC	时代二校-陈天成 (鸭缩毛巾)	14ms	392 KiB		185 Bytes	2023-3-26 22:11:42
AC	王泓涵 (whh)	14ms	428 KiB		136 Bytes	2022-7-21 16:14:15