100以内能被3和5同时整除的数

状态	递交者	时间	内存	语言	代码	递交时间
AC	没有此人 (akm)	-	7 MiB		139 Bytes	2024-1-13 15:41:13
AC	amr (董子溪)	-	7 MiB		191 Bytes	2024-1-17 18:50:25
AC	明轩 (吕同学)	-	7.2 MiB		177 Bytes	2024-1-22 14:11:52
AC	贾博涵	-	6.9 MiB		141 Bytes	2023-11-10 12:34:38
AC	AI创客	-	6.9 MiB		148 Bytes	2023-11-18 22:06:00
AC	JOKER (hhy)	-	6.9 MiB		134 Bytes	2023-12-15 19:30:59
AC	hrz	-	7 MiB		149 Bytes	2024-1-20 15:22:28
AC	新壹街.曾祥睿 (zxr)	-	6.8 MiB		167 Bytes	2023-12-10 21:48:31
AC	新壹街校区-冉睦阳 (冉睦阳)	-	7 MiB		146 Bytes	2023-12-17 12:07:24
AC	Turorany (郑浩然)	-	7.1 MiB		149 Bytes	2023-12-29 19:40:35
AC	金沙校区-蓝祥与 (蓝祥与)	-	7.2 MiB		144 Bytes	2023-12-9 9:55:04
AC	李安桐23025	-	7 MiB		168 Bytes	2024-1-6 22:37:48
AC	庹仕杰	-	6.9 MiB		153 Bytes	2024-1-3 18:26:54
AC	wangruibo20xh	1ms	256 KiB		173 Bytes	2022-2-9 21:28:12
AC	李山水	1ms	256 KiB		178 Bytes	2022-2-8 16:08:04
AC	胡宸华 (huchenhua)	1ms	256 KiB		123 Bytes	2022-11-12 23:01:13
AC	lyc2	1ms	384 KiB		160 Bytes	2022-5-28 19:17:19
AC	zhm123	1ms	384 KiB		148 Bytes	2023-2-6 18:16:46
AC	任瑞的学生 (jiangyadong)	1ms	384 KiB		134 Bytes	2022-6-19 12:57:01
AC	侯治鋆	1ms	384 KiB		159 Bytes	2022-5-20 20:40:59
AC	kim	1ms	384 KiB		167 Bytes	2023-3-3 20:38:55
AC	坤坤荔枝小黑子 (zhonghaotian22006)	1ms	384 KiB		160 Bytes	2023-3-5 16:28:49
AC	Nico	1ms	384 KiB		185 Bytes	2023-5-21 15:22:07
AC	tyx_9192596	1ms	384 KiB		96 Bytes	2023-3-16 8:03:59
AC	李林峰 (金克拉)	1ms	384 KiB		182 Bytes	2023-2-18 9:51:34
AC	魑归sama	1ms	384 KiB		159 Bytes	2022-7-12 16:24:16
AC	凌肯 (lingken22006)	1ms	384 KiB		153 Bytes	2022-7-31 21:56:26
AC	张梓辰 (DiaoDesi屌德斯)	1ms	384 KiB		148 Bytes	2022-9-14 19:42:04
AC	杜俊宏	1ms	384 KiB		146 Bytes	2022-3-31 20:07:14
AC	Randy Marsh (杨子腾)	1ms	384 KiB		190 Bytes	2022-4-17 11:14:29
AC	本人天生贪生pass (05c41-cqs)	1ms	384 KiB		193 Bytes	2022-3-17 20:51:28
AC	冒牌陈杰晟【MOD】 (wed)	1ms	384 KiB		112 Bytes	2022-2-28 18:18:39
AC	17779	1ms	384 KiB		142 Bytes	2022-3-10 20:47:35
AC	qwerty	1ms	384 KiB		145 Bytes	2022-3-11 22:02:34
AC	林小博	1ms	384 KiB		182 Bytes	2022-5-12 21:54:52
AC	Sivan	1ms	6.6 MiB	C++98(O2)	135 Bytes	2024-7-13 18:37:03
AC	朱老师 (zyp)	1ms	384 KiB		159 Bytes	2022-8-6 11:26:04
AC	林子沫awa (linziyue)	1ms	384 KiB		178 Bytes	2022-5-29 15:15:05
AC	ycy	1ms	384 KiB		190 Bytes	2022-6-29 18:48:38
AC	kim	1ms	384 KiB		167 Bytes	2023-3-3 20:39:04
AC	我推的乱破 (贺俊楠)	1ms	384 KiB		175 Bytes	2023-3-26 14:41:49
AC	源著校区-宋昊成 (马冬梅)	1ms	384 KiB		215 Bytes	2023-2-25 18:21:29
AC	(05c35-cyd)	1ms	384 KiB		191 Bytes	2022-3-15 20:41:22
AC	杨镇宇	1ms	6.7 MiB	C++98	137 Bytes	2024-6-28 16:58:33
AC	张家豪 (zhangjiahao)	1ms	384 KiB		148 Bytes	2022-6-14 17:34:00
AC	王晨志 (wangchenzhi)	1ms	392 KiB		224 Bytes	2022-5-28 22:52:24
AC	吴思谛 (wusidi)	1ms	384 KiB		178 Bytes	2022-6-11 11:50:03
AC	JOKER (hhy)	1ms	6.8 MiB	C++98	381 Bytes	2024-8-6 17:40:26
AC	时代一校蒋帛希 (13983392730)	1ms	384 KiB		195 Bytes	2023-3-5 16:13:27
AC	kim	1ms	384 KiB		167 Bytes	2023-3-3 20:39:05
AC	lby_joey	1ms	6.7 MiB	C++98(O2)	163 Bytes	2024-7-17 13:54:43
AC	吴恩子	1ms	6.8 MiB		154 Bytes	2023-9-24 13:57:54
AC	周莀熙	1ms	6.9 MiB	C++11	161 Bytes	2024-8-21 17:34:53
AC	kim	1ms	384 KiB		167 Bytes	2023-3-3 20:38:52
AC	程舒然	1ms	6.2 MiB	C++11	153 Bytes	2024-7-18 12:39:41
AC	谭懿轩 (yanyixuan)	1ms	384 KiB		134 Bytes	2022-2-15 18:16:40
AC	张祖名	1ms	6.9 MiB	C++98(O2)	160 Bytes	2024-6-9 11:33:10
AC	时代校区-孔令皓 (konglinghao)	1ms	6.8 MiB	C++98	1021 Bytes	2024-4-22 21:37:38
AC	丁宇涵 (05c35-dyh1)	1ms	384 KiB		195 Bytes	2022-6-5 11:50:22
AC	陈杰晟	1ms	384 KiB		153 Bytes	2022-3-1 19:16:33
AC	芒苒忧 (廖迦南)	1ms	384 KiB		188 Bytes	2022-1-26 20:34:34
AC	CK (李弘毅)	1ms	512 KiB		160 Bytes	2022-11-22 11:20:15
AC	阮 (媚狐不吃道旁李)	1ms	7 MiB	C++98	161 Bytes	2024-5-25 16:27:17
AC	陈玥妙	1ms	6.9 MiB	C++11	146 Bytes	2024-7-2 18:03:23
AC	丛林 (conglin)	1ms	384 KiB		175 Bytes	2022-12-2 21:23:36
AC	凌肯 (lingken22006)	1ms	384 KiB		153 Bytes	2022-7-31 21:56:26
AC	kim	1ms	384 KiB		167 Bytes	2023-3-3 20:38:57
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	1ms	384 KiB		137 Bytes	2022-6-4 13:44:33
AC	孙烽轶 (sfy)	1ms	6.9 MiB	C++98	137 Bytes	2024-5-25 13:33:03
AC	bvvd	1ms	6.8 MiB	C++98	182 Bytes	2024-6-12 16:08:15
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)	1ms	384 KiB		191 Bytes	2023-5-13 12:14:58
AC	qinjin11	1ms	384 KiB		135 Bytes	2022-7-20 10:28:38
AC	Accepted (周芷乐)	1ms	6.8 MiB	C++14	196 Bytes	2024-8-17 15:22:46
AC	陈于硕(我™的) (chenyu)	1ms	384 KiB		169 Bytes	2023-4-8 9:16:55
AC	05c05-hzy	1ms	384 KiB		132 Bytes	2022-6-12 17:14:47
AC	Tender. (05c05-zhou)	1ms	384 KiB		151 Bytes	2023-3-5 18:25:00
AC	繁星 (05c35-zzm)	1ms	384 KiB		180 Bytes	2022-11-26 10:16:49
AC	星野光 (Hoshino Hikari)	1ms	6.8 MiB		168 Bytes	2023-10-24 18:20:46
AC	panyan	1ms	384 KiB		157 Bytes	2022-6-18 15:10:19
AC	cupy战士 (05c05-dkf)	1ms	6.8 MiB		151 Bytes	2023-9-24 11:27:01
AC	新壹街校区-郭老师-陈品烨 (陈品烨)	1ms	6.7 MiB		168 Bytes	2023-10-3 16:43:36
AC	zzl	1ms	6.8 MiB		126 Bytes	2023-11-7 0:43:05
AC	中岛敦 (黄麒瑞)	1ms	6.8 MiB		178 Bytes	2023-10-3 14:58:43
AC	kim	1ms	352 KiB		167 Bytes	2023-3-3 20:39:01
AC	GYZ	1ms	384 KiB		180 Bytes	2022-5-22 20:35:54
AC	何洋名 (heyangming)	1ms	384 KiB		155 Bytes	2022-3-11 16:31:48
AC	zhangyouze (张佑泽)	1ms	6.7 MiB		161 Bytes	2023-11-6 21:15:05
AC	My name is Man (钟卓劭)	1ms	7 MiB	C++98	129 Bytes	2024-6-23 14:10:36
AC	muzili	1ms	384 KiB		147 Bytes	2022-6-17 22:13:12
AC	曹埊睿 (caodirui)	1ms	384 KiB		141 Bytes	2023-4-21 20:08:39
AC	爱琴海校区-黄辰浩 (huangchenhao)	1ms	384 KiB		137 Bytes	2023-2-12 13:23:30
AC	杜启苇 (duqiwei)	1ms	6.6 MiB		133 Bytes	2023-6-10 13:40:10
AC	伍行念 (wuxingnian)	1ms	6.7 MiB		163 Bytes	2023-9-25 18:03:19
AC	田雨杨 (tianyuyang23010)	1ms	7.1 MiB	C++98	171 Bytes	2024-5-9 17:41:02
AC	喵 (蹇心悦)	1ms	384 KiB		150 Bytes	2022-6-18 15:09:12
AC	Yuan (Zongzi1)	1ms	6.6 MiB	C++17(O2)	172 Bytes	2024-7-18 0:09:52
AC	MoonLight ( aaa)	1ms	384 KiB		190 Bytes	2022-1-8 9:48:17
AC	heyuzhe	1ms	7 MiB	C++98	204 Bytes	2024-6-12 18:27:34
AC	时代二校-陈天成 (鸭缩毛巾)	1ms	384 KiB		145 Bytes	2023-4-30 8:13:39
AC	金沙校区-李嘉齐 (李嘉齐)	1ms	6.8 MiB	C++98	146 Bytes	2024-8-9 15:30:01