「程序4-3」素数判定

状态	递交者	时间	内存	语言	代码	递交时间
AC	陌生人 (涂玉龙)	12ms	7.2 MiB		207 Bytes	2024-1-22 14:53:46
AC	姚宏逸	13ms	256 KiB		384 Bytes	2022-3-27 10:30:44
AC	姚宏逸	13ms	384 KiB		367 Bytes	2022-5-14 10:59:11
AC	杨坤霖 (steven)	15ms	256 KiB		252 Bytes	2022-11-5 13:58:51
AC	唐臣谦 (tangchenqian1)	15ms	256 KiB		188 Bytes	2022-11-5 14:37:27
AC	贾博涵	23ms	7 MiB		332 Bytes	2023-12-5 10:06:23
AC	张月恒	25ms	7.2 MiB	C++98(O2)	183 Bytes	2024-6-16 17:05:42
AC	1396013295	25ms	384 KiB		303 Bytes	2022-4-4 10:53:12
AC	wangjunhan	25ms	384 KiB		273 Bytes	2022-5-29 21:03:11
AC	杜俊宏	25ms	384 KiB		316 Bytes	2022-5-17 20:22:17
AC	谢延灏 (xeiyanhao---a handsome boy)	25ms	392 KiB		217 Bytes	2022-5-2 12:58:35
AC	陈奕瑾 (shenxiulinyue)	25ms	384 KiB		184 Bytes	2022-5-13 18:12:42
AC	郑岐蔚	26ms	384 KiB		195 Bytes	2023-3-5 10:47:51
AC	赵泳鑫 (zhaoyongxin)	26ms	512 KiB		295 Bytes	2022-3-31 19:41:01
AC	时代一校 - 冯隆浩 (冯隆浩)	26ms	384 KiB		275 Bytes	2022-7-25 20:08:49
AC	疯神芭芭脱丝 (李卓修)	26ms	384 KiB		222 Bytes	2022-6-9 19:35:29
AC	何洋名 (heyangming)	26ms	384 KiB		256 Bytes	2022-4-10 10:48:38
AC	贾鑫豪 (Mr Sam)	26ms	416 KiB		405 Bytes	2022-4-22 22:20:19
AC	zzzrrrxxx	26ms	6.9 MiB	C++98	197 Bytes	2024-8-21 20:22:21
AC	黄相茗	26ms	384 KiB		295 Bytes	2022-4-6 21:48:25
AC	ycy	26ms	408 KiB		247 Bytes	2022-4-19 21:16:37
AC	张瑞博	26ms	6.9 MiB	C++11	181 Bytes	2024-7-2 19:11:56
AC	周琪渃	26ms	384 KiB		240 Bytes	2023-4-4 22:00:31
AC	陈雨泽1	26ms	392 KiB		247 Bytes	2023-4-21 19:53:10
AC	11111	26ms	440 KiB		357 Bytes	2022-5-23 20:02:13
AC	你个你怎么跟个一样 (钟卓劭)	26ms	6.9 MiB	C++98	236 Bytes	2024-8-20 18:03:47
AC	MZF	26ms	6.9 MiB	C++98(O2)	253 Bytes	2024-6-11 17:53:25
AC	444444444 (唐跃元)	27ms	512 KiB		188 Bytes	2023-5-13 15:22:11
AC	冒牌陈杰晟【MOD】 (wed)	27ms	512 KiB		322 Bytes	2022-4-10 16:13:58
AC	龚铭俊 (哈哈哈)	27ms	392 KiB		288 Bytes	2023-5-19 18:22:34
AC	陈杰晟	27ms	384 KiB		226 Bytes	2022-4-10 15:56:10
AC	周靖松 (ZhouJS)	27ms	392 KiB		266 Bytes	2023-5-13 15:18:12
AC	吕同学是傻逼 (黄立信)	27ms	384 KiB		296 Bytes	2023-5-25 18:53:04
AC	LUKHE (LukeHu)	27ms	512 KiB		331 Bytes	2022-4-16 17:21:27
AC	Tender. (05c05-zhou)	27ms	512 KiB		256 Bytes	2023-5-14 17:12:44
AC	Tender. (05c05-zhou)	27ms	432 KiB		256 Bytes	2023-5-14 17:12:52
AC	黄二娃	28ms	384 KiB		295 Bytes	2022-4-10 14:35:59
AC	xuniaoyin (徐袅音)	28ms	7.3 MiB		218 Bytes	2023-10-15 14:08:03
AC	邹曜丞 (13983097018)	28ms	6.8 MiB		207 Bytes	2023-10-2 14:26:52
AC	汪致卉 (wangzh)	28ms	432 KiB		415 Bytes	2022-4-22 20:28:42
AC	王晨志 (wangchenzhi)	28ms	512 KiB		289 Bytes	2022-7-28 17:11:45
AC	樊竣熠 (lft1114)	28ms	440 KiB		242 Bytes	2022-8-14 17:21:43
AC	MoonLight ( aaa)	28ms	440 KiB		322 Bytes	2022-8-11 11:02:16
AC	芒苒忧 (廖迦南)	28ms	440 KiB		322 Bytes	2022-4-28 18:07:50
AC	时代2校+施皓宬 (shihaocheng)	28ms	384 KiB		205 Bytes	2023-3-25 17:56:11
AC	杜俊宏	28ms	392 KiB		215 Bytes	2022-11-27 12:42:21
AC	曹埊睿 (caodirui)	28ms	512 KiB		235 Bytes	2023-5-14 11:39:47
AC	希蒙 (zhengxingya)	29ms	6.8 MiB		261 Bytes	2023-10-11 17:51:00
AC	许炜铭 (xuweiming)	29ms	6.9 MiB		348 Bytes	2023-10-15 13:27:32
AC	zzy	29ms	512 KiB		310 Bytes	2023-4-8 16:28:22
AC	源著校区-宋昊成 (马冬梅)	29ms	512 KiB		321 Bytes	2023-2-26 20:01:08
AC	张智洋	29ms	384 KiB		239 Bytes	2023-3-25 17:55:31
AC	爱琴海校区-黄辰浩 (huangchenhao)	29ms	7 MiB		221 Bytes	2023-10-28 10:29:49
AC	时代二校-焦雨齐 (Angel)	29ms	384 KiB		209 Bytes	2023-3-25 17:44:54
AC	张子轩 (zhangzixuana)	29ms	512 KiB		585 Bytes	2023-5-13 15:08:15
AC	11451254188 (22029-mjh)	29ms	384 KiB		219 Bytes	2023-3-12 21:10:52
AC	时代2校-程俊燃 (chengjunran)	29ms	6.7 MiB		237 Bytes	2023-8-27 11:00:54
AC	毕浩宇 (bihaoyu)	29ms	512 KiB		196 Bytes	2023-3-30 19:35:06
AC	爱琴海校区-刁钲洋 (刁钲洋)	29ms	6.9 MiB		437 Bytes	2023-8-15 21:13:42
AC	李树崑 (lishukun)	29ms	384 KiB		266 Bytes	2022-11-21 17:59:47
AC	时代二校+王吕棪 (wanglvyan)	30ms	392 KiB		243 Bytes	2023-3-25 17:45:56
AC	新壹街校区-杨轩懿 (杨轩懿1)	30ms	6.9 MiB		215 Bytes	2023-7-25 11:00:38
AC	zhm123	30ms	432 KiB		232 Bytes	2023-3-23 16:52:52
AC	huanglu	30ms	436 KiB		234 Bytes	2023-2-24 22:37:36
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)	30ms	512 KiB		204 Bytes	2023-6-3 9:04:12
AC	miku (阳沐珊)	31ms	7.1 MiB		222 Bytes	2023-7-14 11:44:09
AC	王晴萱	31ms	7 MiB		259 Bytes	2023-7-19 12:05:15
AC	11451254188 (22029-mjh)	31ms	436 KiB		211 Bytes	2023-3-9 21:21:57
AC	韩思辰 (hansichen)	31ms	384 KiB		234 Bytes	2022-12-17 11:23:41
AC	zhm123	31ms	436 KiB		235 Bytes	2022-12-9 14:49:10
AC	时代二校-陈天成 (鸭缩毛巾)	31ms	440 KiB		232 Bytes	2023-3-25 17:42:59
AC	杨浩灵 (金坷拉)	31ms	7.5 MiB		1.1 KiB	2023-7-14 9:46:24
AC	没有此人 (akm)	31ms	6.9 MiB		323 Bytes	2023-7-2 19:08:18
AC	灶门炭治郎：火之神神乐	31ms	420 KiB		234 Bytes	2023-3-25 17:49:28
AC	Randy Marsh (杨子腾)	31ms	512 KiB		220 Bytes	2022-10-1 16:07:26
AC	11451254188 (22029-mjh)	31ms	436 KiB		211 Bytes	2023-3-12 21:06:52
AC	zlx (xiao)	31ms	512 KiB		317 Bytes	2023-3-20 22:05:07
AC	不怎么聪明的家伙 (贺俊楠)	32ms	6.8 MiB		215 Bytes	2023-6-18 9:05:20
AC	陈梓宇	32ms	6.7 MiB		224 Bytes	2023-8-24 14:40:27
AC	^_^ (ctc)	32ms	436 KiB		214 Bytes	2022-10-19 20:22:30
AC	新壹街校区-陈琬舒 (空空大师)	32ms	6.7 MiB		281 Bytes	2023-9-13 11:37:06
AC	陈骏逸 (chenjunyi)	33ms	7 MiB		344 Bytes	2023-7-9 15:11:07
AC	王晴萱	33ms	7.5 MiB		241 Bytes	2023-7-14 11:19:24
AC	pandap&a王皓宸 (WANGHAOCHEN)	33ms	432 KiB		262 Bytes	2022-12-17 10:33:17
AC	colin1112 (墙凌可)	33ms	6.7 MiB		460 Bytes	2023-9-15 14:13:48
AC	任远宁 (renyuanning)	34ms	392 KiB		227 Bytes	2022-11-5 14:06:56
AC	scallway	34ms	7.1 MiB		221 Bytes	2024-1-13 3:45:04
AC	新壹街陈科言 (cky)	35ms	6.9 MiB		249 Bytes	2023-7-19 16:07:04
AC	hrz	38ms	7.3 MiB		263 Bytes	2024-1-22 14:57:37
AC	坤坤荔枝小黑子 (zhonghaotian22006)	39ms	512 KiB		240 Bytes	2022-9-27 19:10:16
AC	高彬月	39ms	7.2 MiB		225 Bytes	2024-1-22 14:57:01
AC	RanHao	65ms	7.3 MiB		432 Bytes	2024-1-5 14:58:12
AC	TBB (杜昊燃)	94ms	440 KiB		296 Bytes	2022-5-2 0:21:03
AC	张梓浩 (zhangzihao)	137ms	764 KiB		189 Bytes	2024-3-24 11:08:15
AC	伍行念 (wuxingnian)	379ms	9.1 MiB	Python 3	188 Bytes	2023-8-16 10:46:11
AC	伍行念 (wuxingnian)	399ms	9.1 MiB	Python 3	185 Bytes	2023-9-12 19:59:07