能被3、5、7整除的数

状态	递交者	时间	内存	语言	代码	递交时间
AC	hangge	15ms	440 KiB		606 Bytes	2023-5-30 19:03:07
AC	colin1112 (墙凌可)	15ms	432 KiB		524 Bytes	2023-3-7 18:46:04
AC	xuaonan	15ms	444 KiB		278 Bytes	2022-10-4 18:00:11
AC	缥 (王硕2012)	15ms	384 KiB		506 Bytes	2023-3-7 20:46:23
AC	wuzhenghan	15ms	392 KiB		502 Bytes	2022-11-2 21:27:17
AC	新壹街罗田雨 (罗田雨29)	15ms	7 MiB		656 Bytes	2023-12-3 23:23:49
AC	我全家SB！！！我没母！！！ (baijinlin)	15ms	384 KiB		326 Bytes	2023-3-11 18:13:50
AC	刘思齐	15ms	6.8 MiB	C++98	467 Bytes	2024-6-26 17:54:51
AC	lafuzbc	15ms	440 KiB		423 Bytes	2022-8-7 16:36:58
AC	xyc (谢雨宸)	15ms	6.7 MiB		396 Bytes	2023-9-3 16:38:39
AC	缥 (王硕2012)	15ms	392 KiB		547 Bytes	2022-10-13 19:53:37
AC	ttt123	15ms	512 KiB		307 Bytes	2022-11-25 19:16:52
AC	梅子楠 (22016-mzn)	15ms	6.9 MiB		419 Bytes	2023-7-16 15:06:38
AC	zhm123	15ms	436 KiB		580 Bytes	2022-11-12 16:26:30
AC	wangyueru	15ms	520 KiB		492 Bytes	2022-10-15 19:24:02
AC	朱老师 (zyp)	15ms	384 KiB		317 Bytes	2023-3-11 18:03:12
AC	时代2校+施皓宬 (shihaocheng)	15ms	7.6 MiB		853 Bytes	2023-7-1 18:43:39
AC	余晨浩 (yuchenhao)	15ms	6.7 MiB		400 Bytes	2023-8-31 14:47:37
AC	新一街校区Jason_LuoYouZheng (罗友峥)	15ms	444 KiB		377 Bytes	2023-1-20 16:48:32
AC	肖添宇	15ms	436 KiB		299 Bytes	2022-8-28 15:27:53
AC	liangyuntian23003	15ms	508 KiB		314 Bytes	2023-3-11 18:07:37
AC	南坪校区-郑力博 (zhenglibo23003)	15ms	436 KiB		218 Bytes	2023-3-11 18:00:25
AC	李彦臻	15ms	6.9 MiB		396 Bytes	2023-6-28 10:40:13
AC	许徐非凡 (非同凡响)	15ms	432 KiB		512 Bytes	2022-10-7 21:34:07
AC	yxj	15ms	512 KiB		724 Bytes	2022-10-20 15:15:32
AC	源著校区-宋昊成 (马冬梅)	15ms	432 KiB		612 Bytes	2023-2-25 17:21:08
AC	余晨浩 (yuchenhao)	15ms	6.7 MiB		400 Bytes	2023-8-31 14:46:36
AC	杜是贤 (dushixian)	15ms	512 KiB		206 Bytes	2023-5-28 11:21:58
AC	王彬羽 (wby)	15ms	7.3 MiB		581 Bytes	2023-6-24 11:22:26
AC	Tender. (05c05-zhou)	15ms	436 KiB		481 Bytes	2022-9-25 14:20:09
AC	ganlin1	15ms	7.5 MiB		310 Bytes	2023-7-12 14:17:46
AC	余晨浩 (yuchenhao)	15ms	6.7 MiB		400 Bytes	2023-8-31 14:46:47
AC	凌肯 (lingken22006)	15ms	440 KiB		467 Bytes	2022-7-31 18:53:35
AC	李睿杰	15ms	440 KiB		515 Bytes	2023-1-2 11:33:48
AC	余晨浩 (yuchenhao)	15ms	6.7 MiB		400 Bytes	2023-8-31 14:48:32
AC	scallway	16ms	432 KiB		433 Bytes	2022-9-3 16:54:24
AC	余晨浩 (yuchenhao)	16ms	6.7 MiB		400 Bytes	2023-8-31 14:47:51
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	16ms	448 KiB		624 Bytes	2023-1-12 16:57:29
AC	司雨来 (siyulai)	16ms	448 KiB		494 Bytes	2022-10-6 16:35:39
AC	黄立信	16ms	432 KiB		240 Bytes	2023-3-10 14:15:43
AC	张梓辰 (DiaoDesi屌德斯)	16ms	384 KiB		512 Bytes	2022-9-14 18:42:00
AC	刘蕤箎	16ms	512 KiB		488 Bytes	2023-4-16 17:19:07
AC	huanglu	16ms	7 MiB		278 Bytes	2023-7-15 14:09:27
AC	chaikexu	16ms	440 KiB		357 Bytes	2022-12-3 19:39:09
AC	曹埊睿 (caodirui)	16ms	384 KiB		244 Bytes	2023-4-17 19:02:41
AC	德克萨斯做的到吗 (liyangbao)	16ms	512 KiB		387 Bytes	2022-11-5 21:01:13
AC	叶令子	16ms	6.8 MiB		556 Bytes	2023-11-8 20:34:02
AC	李彭宋代诗人 (ljy123456)	16ms	512 KiB		580 Bytes	2023-3-21 14:49:00
AC	何煜琦	16ms	7 MiB	C++11	207 Bytes	2024-8-25 11:00:33
AC	pandap&a王皓宸 (WANGHAOCHEN)	16ms	512 KiB		471 Bytes	2022-11-19 8:23:41
AC	(金沙天街)严皓月 (严皓月)	16ms	6.9 MiB		357 Bytes	2023-7-22 10:55:44
AC	zcx	16ms	412 KiB		468 Bytes	2022-10-15 10:31:43
AC	zzzhhhooonnnggg	16ms	524 KiB		537 Bytes	2023-3-19 18:38:51
AC	wzzjnb2012	16ms	512 KiB		332 Bytes	2022-9-26 22:55:00
AC	Him神	16ms	6.9 MiB		441 Bytes	2023-11-19 16:43:53
AC	李龙腾 (llt)	16ms	512 KiB		265 Bytes	2023-3-19 13:10:33
AC	杨坤霖 (steven)	16ms	444 KiB		227 Bytes	2023-1-10 16:31:37
AC	Nico	16ms	444 KiB		401 Bytes	2022-12-23 16:57:23
AC	时代一校蒋帛希 (13983392730)	16ms	424 KiB		353 Bytes	2022-9-28 20:29:42
AC	zzzrrrxxx	16ms	7 MiB		519 Bytes	2023-7-13 8:56:10
AC	章愉霖	16ms	7 MiB		208 Bytes	2023-6-11 17:37:39
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)	16ms	512 KiB		576 Bytes	2022-10-2 19:42:07
AC	xflt_dyp	16ms	6.9 MiB		357 Bytes	2023-7-22 16:02:46
AC	颜梓宇	16ms	6.9 MiB		478 Bytes	2023-8-8 18:38:54
AC	guozuming	16ms	436 KiB		305 Bytes	2022-12-20 22:07:03
AC	杨瀚霖 (yanghanlin)	17ms	436 KiB		602 Bytes	2023-5-28 15:47:46
AC	刘致言	17ms	512 KiB		277 Bytes	2023-3-11 9:21:13
AC	RanHao	17ms	6.9 MiB		340 Bytes	2023-7-20 17:01:14
AC	龙猫	17ms	7.1 MiB		480 Bytes	2023-7-10 19:23:19
AC	毕浩宇 (bihaoyu)	17ms	7.1 MiB		219 Bytes	2023-7-14 16:40:47
AC	colin1112 (墙凌可)	17ms	436 KiB		524 Bytes	2023-1-22 12:26:50
AC	yangbinyu	17ms	420 KiB		609 Bytes	2022-10-2 11:00:54
AC	游智棋	17ms	6.9 MiB		571 Bytes	2023-7-21 8:23:47
AC	除了我全部人都是SB (车涌樯)	17ms	7 MiB		412 Bytes	2023-7-19 14:24:29
AC	wangjun	17ms	7.1 MiB		257 Bytes	2023-11-12 20:08:21
AC	新壹街陈科言 (cky)	17ms	7 MiB		850 Bytes	2023-7-20 11:21:40
AC	新壹街校区--税崇峻 (税崇峻)	17ms	6.9 MiB		244 Bytes	2023-8-8 15:12:09
AC	李歆颜 (llxy)	18ms	6.9 MiB		210 Bytes	2023-8-4 17:05:25
AC	林子沫awa (linziyue)	18ms	440 KiB		721 Bytes	2023-3-16 22:35:32
AC	陈雨泽1	18ms	512 KiB		554 Bytes	2022-10-1 10:40:02
AC	shenyushun2	18ms	436 KiB		418 Bytes	2022-11-30 22:10:09
AC	李山水	19ms	424 KiB		278 Bytes	2022-8-28 19:38:41
AC	yanglang	19ms	432 KiB		246 Bytes	2022-10-21 15:05:56
AC	许嘉恩 (xje22031)	19ms	436 KiB		457 Bytes	2022-11-24 21:35:47
AC	时代一校-王宥量 (wangyouliang)	19ms	512 KiB		434 Bytes	2022-9-25 12:04:36
AC	许律天	19ms	7.1 MiB		427 Bytes	2023-11-29 18:16:30
AC	朱老师 (zyp)	19ms	448 KiB		385 Bytes	2022-11-16 18:52:30
AC	22029-hqh	20ms	448 KiB		245 Bytes	2022-11-26 18:45:28
AC	煞笔笔	22ms	7.2 MiB		201 Bytes	2024-1-19 10:37:40
AC	AI创客	23ms	6.7 MiB		199 Bytes	2023-11-20 22:11:39
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	23ms	7 MiB		511 Bytes	2023-12-10 20:08:31
AC	Turorany (郑浩然)	23ms	7 MiB		218 Bytes	2023-12-28 18:18:27
AC	新壹街.曾祥睿 (zxr)	23ms	7.1 MiB		428 Bytes	2023-12-6 22:16:58
AC	张智洋	24ms	7.2 MiB		552 Bytes	2023-11-25 18:58:41
AC	Him神	24ms	6.9 MiB		443 Bytes	2023-11-19 16:43:19
AC	高彬月	26ms	7 MiB		233 Bytes	2023-11-10 20:23:29
AC	时代一校石博文 (shibowen)	27ms	7 MiB		275 Bytes	2023-12-27 21:04:01
AC	王康瑞	62ms	536 KiB		267 Bytes	2024-2-24 11:44:29
AC	梁家畅	63ms	552 KiB	C++11(O2)	343 Bytes	2024-11-22 21:30:11
AC	新壹街-陈恺曦 (陈恺曦)	64ms	536 KiB	C++98	202 Bytes	2024-10-18 18:25:22