能被 3 整除的数字之和

状态	递交者	时间	内存	语言	代码	递交时间
AC	陈于硕(我™的) (chenyu)	7ms	412 KiB		197 Bytes	2023-5-30 21:03:24
AC	xuniaoyin (徐袅音)	7ms	6.9 MiB		200 Bytes	2023-7-28 12:27:09
AC	chenruoxi	7ms	7 MiB	C++98	153 Bytes	2024-6-19 19:01:47
AC	张瑞博	7ms	7.2 MiB	C++11	163 Bytes	2024-4-28 17:39:05
AC	wuqilin	7ms	404 KiB		179 Bytes	2022-10-22 23:28:32
AC	xiangsiyu	7ms	436 KiB		169 Bytes	2022-6-23 19:53:43
AC	付博plus	7ms	384 KiB		158 Bytes	2022-8-27 13:17:39
AC	杜是贤 (dushixian)	7ms	444 KiB		167 Bytes	2022-3-13 10:55:33
AC	疯神芭芭脱丝 (李卓修)	7ms	392 KiB		205 Bytes	2022-1-25 16:03:12
AC	Ruler (05c35-hjs)	7ms	512 KiB		178 Bytes	2022-3-5 20:29:00
AC	凌肯 (lingken22006)	7ms	392 KiB		214 Bytes	2022-6-3 20:02:25
AC	罗宇凡 (吴彦祖)	7ms	392 KiB		212 Bytes	2022-2-20 12:05:48
AC	星野光 (Hoshino Hikari)	7ms	6.8 MiB		426 Bytes	2023-10-22 22:16:35
AC	leisixian (22029-lyh)	7ms	392 KiB		183 Bytes	2022-11-5 11:16:50
AC	dyp (hhy)	7ms	6.8 MiB		171 Bytes	2023-10-13 13:49:10
AC	新壹街.曾祥睿 (zxr)	7ms	6.6 MiB		173 Bytes	2023-9-21 18:57:19
AC	杨颂恩 (yangsongen)	7ms	6.8 MiB		163 Bytes	2023-11-8 18:34:27
AC	曹埊睿 (caodirui)	7ms	444 KiB		151 Bytes	2023-5-1 21:56:43
AC	陈廷恩	7ms	6.9 MiB		173 Bytes	2023-10-13 20:35:34
AC	ttt123	7ms	416 KiB		188 Bytes	2022-11-5 11:13:56
AC	源著校区-宋昊成 (马冬梅)	7ms	432 KiB		187 Bytes	2023-2-25 18:08:29
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	7ms	6.8 MiB	C++98	161 Bytes	2024-8-14 22:46:30
AC	dengfeng	7ms	428 KiB		152 Bytes	2022-7-23 19:13:39
AC	纪承熙	7ms	512 KiB		250 Bytes	2022-2-19 20:17:17
AC	22029-lsl	7ms	512 KiB		224 Bytes	2022-11-5 11:15:40
AC	极为的好van的 (lyq)	7ms	384 KiB		194 Bytes	2022-6-19 11:29:43
AC	张梓辰 (DiaoDesi屌德斯)	7ms	428 KiB		200 Bytes	2022-9-14 19:28:55
AC	繁星 (05c35-zzm)	7ms	444 KiB		224 Bytes	2022-8-18 13:33:12
AC	杨瀚霖 (yanghanlin)	7ms	436 KiB		193 Bytes	2023-2-24 21:11:17
AC	yuhaodi	7ms	436 KiB		214 Bytes	2023-5-11 15:51:09
AC	黄俊皓	7ms	420 KiB		303 Bytes	2022-4-16 20:16:00
AC	重庆新壹街-钟政鑫 (钟政鑫)	7ms	6.8 MiB		155 Bytes	2023-10-9 20:09:37
AC	李龙腾 (llt)	7ms	384 KiB		167 Bytes	2023-3-19 13:58:59
AC	赵彬鸿	7ms	384 KiB		172 Bytes	2022-8-13 11:45:48
AC	吴俊成 (wujuncheng)	7ms	440 KiB		247 Bytes	2022-7-9 22:17:00
AC	赵彬鸿	7ms	392 KiB		172 Bytes	2022-8-13 11:45:41
AC	22029-zjs	7ms	384 KiB		207 Bytes	2022-11-5 11:16:54
AC	22029-hqh	7ms	384 KiB		212 Bytes	2022-11-5 11:57:14
AC	cupy战士 (05c05-dkf)	7ms	6.9 MiB		168 Bytes	2023-9-24 11:36:18
AC	霍弈丞小号	7ms	436 KiB		179 Bytes	2023-4-9 11:49:52
AC	赵彬鸿	7ms	384 KiB		172 Bytes	2022-8-13 11:45:47
AC	tsc_ (杨悦堃)	7ms	432 KiB		168 Bytes	2023-4-22 15:42:24
AC	Microsoft (hu_moren)	7ms	7 MiB	C++98	219 Bytes	2024-8-24 16:36:36
AC	陈信羽	7ms	7 MiB	C++98	157 Bytes	2024-6-19 18:57:52
AC	冒牌陈杰晟【MOD】 (wed)	7ms	432 KiB		145 Bytes	2022-2-24 19:45:13
AC	李晨希	7ms	384 KiB		199 Bytes	2023-4-8 9:28:34
AC	罗兰（漆黑襟默) (zhangxiaoci)	7ms	392 KiB		173 Bytes	2022-8-27 20:01:51
AC	yanglang	7ms	512 KiB		143 Bytes	2022-10-21 23:32:41
AC	huanglu	7ms	7.1 MiB		168 Bytes	2023-7-15 16:10:00
AC	丛林 (conglin)	7ms	436 KiB		194 Bytes	2022-12-2 17:22:11
AC	江坤锜	7ms	6.4 MiB		193 Bytes	2023-6-3 18:04:42
AC	付博plus	7ms	440 KiB		158 Bytes	2022-8-27 19:44:52
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)	7ms	444 KiB		192 Bytes	2022-10-23 15:06:11
AC	miku (阳沐珊)	7ms	420 KiB		185 Bytes	2023-3-23 17:45:32
AC	代尚函笛卡尔 (daishanghan)	7ms	384 KiB		175 Bytes	2022-8-27 13:11:08
AC	marz	7ms	7 MiB	C++98	209 Bytes	2024-6-8 16:20:28
AC	Accepted (周芷乐)	7ms	7 MiB	C++14	189 Bytes	2024-6-18 11:56:04
AC	My name is Man (钟卓劭)	7ms	7 MiB	C++98	164 Bytes	2024-6-23 14:04:39
AC	源著校区陈锐霖 (13983855850)	7ms	7 MiB	C++11	167 Bytes	2024-8-24 11:06:10
AC	疯神芭芭脱丝 (李卓修)	7ms	432 KiB		193 Bytes	2022-7-16 13:41:04
AC	苏庭毅	7ms	392 KiB		178 Bytes	2023-3-30 20:06:51
AC	MoonLight ( aaa)	7ms	448 KiB		243 Bytes	2022-2-19 9:35:07
AC	王昱祺 (12王昱祺)	7ms	6.8 MiB		185 Bytes	2023-10-29 16:30:20
AC	谭懿轩 (yanyixuan)	7ms	416 KiB		157 Bytes	2022-2-15 14:36:50
AC	况奕辛 (KYX_yyds)	7ms	436 KiB		242 Bytes	2022-2-25 20:13:42
AC	肖添宇	7ms	384 KiB		183 Bytes	2022-8-23 17:58:47
AC	yaokaixuan	7ms	512 KiB		337 Bytes	2022-2-20 11:47:57
AC	SB (mfy01)	7ms	432 KiB		167 Bytes	2022-12-2 13:49:23
AC	章愉霖	7ms	432 KiB		227 Bytes	2023-6-1 11:07:56
AC	赵志陶 (zztzzt)	7ms	436 KiB		184 Bytes	2022-10-23 11:25:23
AC	周子涵	7ms	392 KiB		195 Bytes	2022-10-1 15:04:29
AC	童语铄	7ms	6.7 MiB		146 Bytes	2023-8-30 15:36:04
AC	Cristiano·Ronaldo (05c41-gmz)	7ms	544 KiB		175 Bytes	2022-7-27 13:40:20
AC	陈雨泽1	7ms	432 KiB		163 Bytes	2023-2-18 11:06:55
AC	李晨希	7ms	392 KiB		199 Bytes	2023-5-24 19:23:18
AC	新壹街校区-周士杰 (zsj)	7ms	6.7 MiB		143 Bytes	2023-8-28 9:06:55
AC	xzf	7ms	6.9 MiB		232 Bytes	2023-9-3 11:44:08
AC	曹元明	7ms	436 KiB		177 Bytes	2022-9-3 19:01:30
AC	zzzrrrxxx	7ms	6.9 MiB		160 Bytes	2023-7-16 14:20:20
AC	xiongxinyao	7ms	436 KiB		245 Bytes	2022-10-21 20:09:10
AC	新壹街校区--税崇峻 (税崇峻)	7ms	6.9 MiB		151 Bytes	2023-8-16 18:47:46
AC	牟淳雅	7ms	6.9 MiB		201 Bytes	2023-7-20 21:59:10
AC	洛谷：AIDczy（uid:656765） (chenzeyu)	7ms	432 KiB		165 Bytes	2022-3-3 20:08:42
AC	何欣洋	7ms	384 KiB		211 Bytes	2023-4-8 9:29:27
AC	靳博然 (jbr)	7ms	432 KiB		190 Bytes	2023-3-19 17:43:44
AC	贾博涵	7ms	6.8 MiB		168 Bytes	2023-11-8 11:38:16
AC	罗翌珂 (dangdang)	7ms	432 KiB		200 Bytes	2022-9-3 10:35:34
AC	李林峰 (金克拉)	7ms	420 KiB		165 Bytes	2023-2-18 8:56:24
AC	新一街校区Jason_LuoYouZheng (罗友峥)	7ms	384 KiB		276 Bytes	2023-3-20 20:42:24
AC	谁陪訫牞（杀手） (22029-zys)	7ms	448 KiB		181 Bytes	2023-1-4 17:53:54
AC	muzili	7ms	384 KiB		151 Bytes	2022-4-10 18:54:28
AC	李旻轩	7ms	440 KiB		250 Bytes	2023-4-8 9:27:52
AC	炸鱼4000+ (dxc)	7ms	448 KiB		196 Bytes	2023-3-8 21:21:21
AC	heyi	7ms	6.8 MiB	C++98(O2)	208 Bytes	2024-8-9 14:22:47
AC	叶哲宇 (yzy)	7ms	512 KiB		174 Bytes	2023-4-16 9:55:43
AC	陈致远Lynn	7ms	7 MiB	C++11	196 Bytes	2024-8-25 10:33:29
AC	呵呵呵 (陈思琦)	7ms	6.9 MiB		155 Bytes	2023-8-20 20:11:51
AC	罗莎莎	7ms	436 KiB		187 Bytes	2022-9-16 17:10:58
AC	zhuqiwei22006	7ms	440 KiB		147 Bytes	2022-11-13 11:58:55
AC	sb (吴振宇)	7ms	436 KiB		191 Bytes	2023-4-22 19:45:21