求1*2*3*...n 的积

状态	递交者	时间	内存	语言	代码	递交时间
AC	kim	14ms	384 KiB		173 Bytes	2023-3-3 19:26:13
AC	luoluonuoya	14ms	384 KiB		156 Bytes	2022-1-24 16:11:51
AC	kim	14ms	388 KiB		173 Bytes	2023-3-3 19:26:20
AC	黄相茗	14ms	384 KiB		236 Bytes	2022-4-9 18:47:01
AC	爱情海校区—沙天一 (沙天一)	14ms	392 KiB		183 Bytes	2023-3-11 10:56:42
AC	你爹 (郭铠嘉)	14ms	384 KiB		173 Bytes	2022-2-10 18:44:36
AC	杨瀚霖 (yanghanlin)	14ms	392 KiB		166 Bytes	2022-12-31 11:03:23
AC	赵彬鸿	14ms	384 KiB		158 Bytes	2022-5-21 15:14:54
AC	繁星 (05c35-zzm)	14ms	384 KiB		178 Bytes	2022-10-29 15:43:25
AC	新壹街校区-杨轩懿 (杨轩懿1)	14ms	6.9 MiB		143 Bytes	2023-7-25 12:54:01
AC	王康瑞	14ms	7.1 MiB		180 Bytes	2023-11-18 11:04:09
AC	赵彬鸿	14ms	384 KiB		158 Bytes	2022-5-21 15:14:58
AC	爱情海校区—沙天一 (沙天一)	14ms	392 KiB		183 Bytes	2023-3-11 10:56:50
AC	pandap&a王皓宸 (WANGHAOCHEN)	14ms	384 KiB		178 Bytes	2023-2-24 18:35:44
AC	张月恒	14ms	6.9 MiB	C++98(O2)	152 Bytes	2024-8-23 15:20:57
AC	黄立信	14ms	6.8 MiB		181 Bytes	2023-10-14 12:52:47
AC	xzf	14ms	6.7 MiB		259 Bytes	2023-9-24 16:32:09
AC	殷语函	14ms	6.9 MiB	C++11	174 Bytes	2024-8-23 21:43:29
AC	kim	14ms	384 KiB		173 Bytes	2023-3-3 19:26:09
AC	赵彬鸿	14ms	436 KiB		136 Bytes	2022-8-13 14:22:38
AC	凌肯 (lingken22006)	14ms	512 KiB		180 Bytes	2022-7-31 21:54:03
AC	longhao	14ms	384 KiB		184 Bytes	2022-1-24 16:12:16
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	440 KiB		159 Bytes	2022-11-19 11:47:18
AC	况奕辛 (KYX_yyds)	14ms	440 KiB		168 Bytes	2022-2-25 21:13:20
AC	赵彬鸿	14ms	392 KiB		158 Bytes	2022-5-21 15:14:58
AC	Guest	14ms	7 MiB	C++98(O2)	152 Bytes	2024-8-24 14:17:18
AC	赵彬鸿	14ms	384 KiB		136 Bytes	2022-8-13 14:22:32
AC	赵彬鸿	14ms	392 KiB		158 Bytes	2022-5-21 15:14:50
AC	唐臣谦 (tangchenqian1)	14ms	384 KiB		167 Bytes	2022-11-24 20:30:31
AC	kim	14ms	384 KiB		173 Bytes	2023-3-3 19:28:01
AC	赵彬鸿	14ms	384 KiB		136 Bytes	2022-8-13 14:22:27
AC	kim	14ms	384 KiB		173 Bytes	2023-3-3 19:26:12
AC	CK (李弘毅)	14ms	384 KiB		191 Bytes	2022-10-15 16:51:40
AC	_PXY_	14ms	384 KiB		245 Bytes	2022-1-26 14:08:12
AC	Nico	14ms	448 KiB		176 Bytes	2023-4-16 14:45:41
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	14ms	384 KiB		146 Bytes	2022-11-5 9:29:44
AC	李山水	14ms	384 KiB		200 Bytes	2022-3-23 19:40:32
AC	kim	14ms	392 KiB		173 Bytes	2023-3-3 19:28:04
AC	张子扬	14ms	392 KiB		215 Bytes	2022-1-20 19:50:47
AC	傅博涛	14ms	392 KiB		143 Bytes	2022-1-30 17:29:26
AC	yanglang	14ms	392 KiB		148 Bytes	2022-10-22 21:09:43
AC	hyh22031	14ms	384 KiB		156 Bytes	2022-12-4 10:37:10
AC	dyp (hhy)	14ms	6.8 MiB		199 Bytes	2023-10-13 16:19:15
AC	赵彬鸿	14ms	384 KiB		136 Bytes	2022-8-13 14:22:28
AC	陈家齐 (陈家齐1)	14ms	384 KiB		141 Bytes	2023-4-1 19:58:59
AC	ganlin1	14ms	6.9 MiB		191 Bytes	2023-7-20 10:31:06
AC	游智棋	14ms	7.1 MiB	C++17	180 Bytes	2024-4-20 22:04:20
AC	诸禹吉 (zhuyuji)	14ms	384 KiB		174 Bytes	2022-8-28 11:50:49
AC	时代一校-曾科智 (曾科智)	14ms	432 KiB		166 Bytes	2023-3-4 18:37:06
AC	WHWHWHWHWHW (OP AI)	14ms	6.9 MiB	C++98	161 Bytes	2024-6-25 15:28:17
AC	时代一校蒋帛希 (13983392730)	14ms	488 KiB		154 Bytes	2023-3-12 19:00:27
AC	文硕 (文硕1)	14ms	428 KiB		236 Bytes	2022-7-12 11:32:05
AC	kim	14ms	392 KiB		173 Bytes	2023-3-3 19:26:08
AC	爱猫人士	14ms	392 KiB		168 Bytes	2022-2-19 15:51:12
AC	呵呵呵 (陈思琦)	14ms	388 KiB		148 Bytes	2022-10-15 16:51:56
AC	miku (阳沐珊)	14ms	392 KiB		210 Bytes	2023-4-1 20:03:20
AC	yixingyou	14ms	384 KiB		154 Bytes	2022-10-15 16:53:25
AC	黄梓轩 (huangzixuan)	14ms	384 KiB		169 Bytes	2022-10-15 16:51:40
AC	炸鱼4000+ (dxc)	14ms	512 KiB		166 Bytes	2023-5-30 18:46:46
AC	kim	14ms	392 KiB		173 Bytes	2023-3-3 19:27:58
AC	胡宸华 (huchenhua)	14ms	512 KiB		158 Bytes	2022-11-6 14:11:23
AC	强愉堃 (强愉堃1)	14ms	384 KiB		139 Bytes	2023-4-1 20:02:10
AC	zhangyouze (张佑泽)	14ms	6.8 MiB		160 Bytes	2023-10-21 23:35:39
AC	中岛敦 (黄麒瑞)	14ms	6.8 MiB		181 Bytes	2023-10-3 11:23:40
AC	王韵淮	14ms	416 KiB		150 Bytes	2022-4-17 9:52:40
AC	我很6 (zjj22031)	14ms	384 KiB		181 Bytes	2022-12-2 15:14:16
AC	chenyantong	14ms	400 KiB		145 Bytes	2023-3-3 19:30:47
AC	赵彬鸿	14ms	384 KiB		158 Bytes	2022-5-21 15:14:54
AC	彭崇鑫	14ms	384 KiB		152 Bytes	2022-10-15 16:52:09
AC	赵彬鸿	14ms	384 KiB		158 Bytes	2022-5-21 15:14:53
AC	miku (阳沐珊)	14ms	432 KiB		210 Bytes	2023-5-29 12:17:05
AC	冒牌陈杰晟【MOD】 (wed)	14ms	444 KiB		163 Bytes	2022-3-2 21:02:21
AC	zvt_132 (任子轩)	14ms	6.9 MiB		187 Bytes	2023-7-19 16:37:00
AC	陈家齐 (陈家齐1)	14ms	512 KiB		141 Bytes	2023-4-1 19:59:02
AC	Cristiano·Ronaldo (05c41-gmz)	14ms	512 KiB		136 Bytes	2022-7-27 13:42:06
AC	chenyantong	14ms	384 KiB		145 Bytes	2023-3-3 19:30:47
AC	chenyantong	14ms	384 KiB		145 Bytes	2023-3-3 19:30:45
AC	soha (武夷岩)	14ms	384 KiB		169 Bytes	2022-10-15 16:52:31
AC	曹烜豪	14ms	384 KiB		160 Bytes	2023-4-1 20:05:29
AC	爱琴海校区-黄辰浩 (huangchenhao)	14ms	7 MiB		251 Bytes	2023-7-1 20:51:13
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	14ms	384 KiB		184 Bytes	2023-1-15 16:17:49
AC	444444444 (唐跃元)	14ms	6.7 MiB		150 Bytes	2023-8-29 16:06:07
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	14ms	384 KiB		183 Bytes	2022-11-27 11:24:21
AC	SYC0226	14ms	444 KiB		184 Bytes	2022-3-20 11:08:15
AC	laiyouming22031	14ms	388 KiB		146 Bytes	2022-11-27 11:46:09
AC	时代校区-孔令皓 (konglinghao)	14ms	7.2 MiB	C++98	1015 Bytes	2024-4-21 22:01:22
AC	chenyantong	14ms	384 KiB		145 Bytes	2023-3-3 19:30:46
AC	爱琴海校区-胡靖欢 (胡靖欢1)	14ms	512 KiB		174 Bytes	2023-3-11 10:55:29
AC	王乐仪	14ms	440 KiB		158 Bytes	2022-2-4 15:56:07
AC	希蒙 (zhengxingya)	14ms	6.7 MiB		240 Bytes	2023-8-22 16:24:00
AC	赵彬鸿	14ms	384 KiB		158 Bytes	2022-5-21 15:14:53
AC	不怎么聪明的家伙 (贺俊楠)	14ms	384 KiB		181 Bytes	2023-3-26 14:39:37
AC	Jack	14ms	512 KiB		161 Bytes	2022-8-17 19:12:05
AC	hyh	14ms	384 KiB		168 Bytes	2023-3-11 10:57:56
AC	第五人格启动 (罗子键)	14ms	384 KiB		166 Bytes	2023-4-1 20:16:47
AC	向俊熙 (xiangjunxi23003)	14ms	6.7 MiB		142 Bytes	2023-9-7 20:25:16
AC	汪致卉 (wangzh)	15ms	428 KiB		224 Bytes	2022-4-22 16:12:42
AC	源著校区-宋昊成 (马冬梅)	15ms	512 KiB		166 Bytes	2023-2-25 18:16:57
AC	赵彬鸿	15ms	392 KiB		158 Bytes	2022-5-21 15:15:00
AC	赵彬鸿	15ms	384 KiB		136 Bytes	2022-8-13 14:22:30