「NOIP 2002 普及组」级数求和

状态	递交者	时间	内存	语言	代码	递交时间
AC	MoonLight ( aaa)	7ms	256 KiB		149 Bytes	2022-1-1 10:08:49
AC	wangzihang	7ms	308 KiB	C++	193 Bytes	2022-8-3 15:32:59
AC	姚宏逸	8ms	264 KiB		240 Bytes	2022-1-14 19:44:55
AC	赵沛喆	8ms	312 KiB		149 Bytes	2022-7-7 9:27:53
AC	况奕辛 (KYX_yyds)	8ms	384 KiB		149 Bytes	2022-3-8 20:52:01
AC	李树崑 (lishukun)	8ms	316 KiB		260 Bytes	2022-6-26 12:08:28
AC	贾鑫豪 (Mr Sam)	8ms	316 KiB		260 Bytes	2022-11-19 14:24:13
AC	任远宁 (renyuanning)	8ms	324 KiB		170 Bytes	2023-2-13 17:55:50
AC	MacrozClick_ (蒋淞霖)	8ms	316 KiB		368 Bytes	2023-5-1 11:50:08
AC	12345	8ms	384 KiB		142 Bytes	2022-8-9 9:04:50
AC	chen (peter)	8ms	384 KiB		142 Bytes	2022-7-12 14:48:53
AC	潘光瑞 (NB牛牛大师)	8ms	312 KiB		202 Bytes	2022-8-11 11:15:47
AC	曹埊睿 (caodirui)	9ms	316 KiB		149 Bytes	2023-4-18 18:55:25
AC	李彭宋代诗人 (ljy123456)	10ms	308 KiB		254 Bytes	2023-3-22 16:58:13
AC	朱泽晟	13ms	384 KiB		179 Bytes	2022-1-23 21:21:49
AC	tad (OP AI)	13ms	6.8 MiB	C++11	168 Bytes	2024-6-29 13:51:10
AC	Yuan (Zongzi1)	13ms	6.7 MiB	C++17(O2)	241 Bytes	2024-7-18 0:08:48
AC	SMIK	13ms	436 KiB		206 Bytes	2022-8-5 15:11:22
AC	火爆肥肠（杨弘毅） (火爆肥肠)	13ms	384 KiB		253 Bytes	2022-4-3 22:42:31
AC	ycy	13ms	408 KiB		206 Bytes	2022-6-15 15:29:10
AC	longhao	13ms	384 KiB		257 Bytes	2022-3-4 16:08:56
AC	时代一校-王宥量 (wangyouliang)	13ms	384 KiB		169 Bytes	2023-2-12 11:09:20
AC	疯神芭芭脱丝 (李卓修)	13ms	384 KiB		230 Bytes	2022-4-5 17:14:03
AC	任瑞的学生 (jiangyadong)	14ms	392 KiB		304 Bytes	2022-6-19 12:56:05
AC	王瀚毅 (wanghanyi)	14ms	384 KiB		157 Bytes	2023-2-12 11:09:27
AC	My name is Man (钟卓劭)	14ms	6.8 MiB	C++98	152 Bytes	2024-6-16 12:38:24
AC	黄梓桐 (HuangZiTong)	14ms	384 KiB		171 Bytes	2022-7-20 16:34:01
AC	疯神芭芭脱丝 (李卓修)	14ms	384 KiB		230 Bytes	2022-4-5 17:13:23
AC	maomao	14ms	384 KiB		181 Bytes	2022-5-25 19:22:24
AC	无尽的想象 (谭仕高)	14ms	392 KiB		180 Bytes	2022-7-28 13:33:34
AC	Accepted (周芷乐)	14ms	6.9 MiB	C++14	169 Bytes	2024-8-17 15:22:11
AC	Sivan	14ms	6.7 MiB	C++98(O2)	194 Bytes	2024-7-13 17:39:23
AC	1396013295	14ms	392 KiB		262 Bytes	2022-1-24 18:40:02
AC	Erin	14ms	7 MiB	C++98	170 Bytes	2024-5-4 19:31:15
AC	曾御城（现用名） (Jason)	14ms	384 KiB		166 Bytes	2022-6-1 18:53:03
AC	heyi	14ms	6.8 MiB	C++98(O2)	245 Bytes	2024-8-10 13:33:31
AC	文硕 (文硕1)	14ms	388 KiB		244 Bytes	2022-7-12 11:34:34
AC	时代一校-赵彦博 (zyb)	14ms	384 KiB		167 Bytes	2023-2-12 11:08:12
AC	22029-hqh	14ms	512 KiB		224 Bytes	2022-12-3 9:57:44
AC	阮 (媚狐不吃道旁李)	14ms	7.2 MiB	C++98	148 Bytes	2024-5-19 13:19:50
AC	zlx (xiao)	14ms	384 KiB		293 Bytes	2022-5-25 19:55:15
AC	肖添宇	14ms	440 KiB		203 Bytes	2022-4-16 17:56:38
AC	贾博涵	14ms	6.9 MiB		189 Bytes	2023-11-10 12:32:14
AC	刘政君 (lzj)	14ms	440 KiB		203 Bytes	2022-8-9 22:30:50
AC	火爆肥肠（杨弘毅） (火爆肥肠)	14ms	384 KiB		480 Bytes	2022-4-3 22:50:10
AC	杜俊宏	14ms	384 KiB		261 Bytes	2022-5-22 16:17:31
AC	_PXY_	14ms	384 KiB		202 Bytes	2022-1-26 14:12:18
AC	芒苒忧 (廖迦南)	14ms	384 KiB		212 Bytes	2022-1-26 20:34:17
AC	黄立信	14ms	6.8 MiB		166 Bytes	2023-10-15 13:21:40
AC	wangruibo20xh	14ms	6.8 MiB		131 Bytes	2023-11-7 12:20:37
AC	AG.一诺	14ms	512 KiB		152 Bytes	2022-3-2 19:48:07
AC	蒲梓勋 (puzixun)	14ms	384 KiB		217 Bytes	2022-8-12 17:46:53
AC	李林峰 (金克拉)	15ms	440 KiB		188 Bytes	2023-2-18 9:51:07
AC	汪致卉 (wangzh)	15ms	444 KiB		166 Bytes	2022-1-22 19:55:50
AC	吴俊成 (wujuncheng)	15ms	452 KiB		203 Bytes	2022-7-10 11:46:28
AC	_daa	15ms	384 KiB		166 Bytes	2022-3-12 9:20:28
AC	源著校区-宋昊成 (马冬梅)	15ms	512 KiB		216 Bytes	2023-2-25 18:21:07
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	15ms	384 KiB		207 Bytes	2022-3-2 18:52:32
AC	蒲梓勋 (puzixun)	15ms	440 KiB		217 Bytes	2022-8-12 17:46:52
AC	maobohan	15ms	7.3 MiB		224 Bytes	2023-12-16 10:06:13
AC	赵鑫宸 (xiaoxiao721)	15ms	436 KiB		217 Bytes	2022-2-26 16:37:19
AC	炼狱杏寿郎（的粉粉粉粉粉） (sheijiangwohh)	15ms	392 KiB		269 Bytes	2022-3-2 20:15:52
AC	陈杰晟	15ms	440 KiB		193 Bytes	2022-2-23 15:04:09
AC	城市之光	15ms	392 KiB		215 Bytes	2023-3-4 11:52:48
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	15ms	6.8 MiB		198 Bytes	2023-11-2 19:55:50
AC	周琪渃	15ms	388 KiB		240 Bytes	2023-3-25 18:23:51
AC	经常消失 (小萝卜)	15ms	512 KiB		215 Bytes	2022-9-13 21:42:27
AC	谭懿轩 (yanyixuan)	15ms	436 KiB		161 Bytes	2022-2-15 18:14:59
AC	qwerty	15ms	432 KiB		182 Bytes	2022-3-11 22:01:21
AC	呵呵呵 (陈思琦)	15ms	412 KiB		192 Bytes	2022-10-5 13:13:30
AC	赵泳鑫 (zhaoyongxin)	15ms	436 KiB		244 Bytes	2022-7-12 11:21:51
AC	22029-zjs	15ms	392 KiB		210 Bytes	2022-12-3 10:08:13
AC	zcx	15ms	392 KiB		216 Bytes	2022-12-3 10:13:20
AC	没有此人 (akm)	15ms	6.9 MiB		246 Bytes	2023-7-4 16:24:43
AC	伍行念 (wuxingnian)	15ms	6.7 MiB		232 Bytes	2023-9-25 17:59:40
AC	zhoumingze23017	15ms	6.7 MiB		174 Bytes	2023-8-31 14:35:21
AC	冒牌陈杰晟【MOD】 (wed)	15ms	384 KiB		166 Bytes	2022-3-4 20:01:02
AC	张祖名	15ms	6.7 MiB		216 Bytes	2023-8-30 14:22:18
AC	wzzjnb2012	15ms	444 KiB		294 Bytes	2022-10-3 9:41:46
AC	scallway	15ms	512 KiB		215 Bytes	2022-10-5 13:08:47
AC	SYC0226	15ms	436 KiB		184 Bytes	2022-3-20 12:44:45
AC	殷语函	15ms	6.9 MiB	C++11	176 Bytes	2024-8-23 21:47:10
AC	yu (赵子瑜)	15ms	432 KiB		167 Bytes	2022-3-1 20:07:57
AC	22029-lyh	15ms	392 KiB		210 Bytes	2022-12-3 10:08:58
AC	黄鹏翰	15ms	384 KiB		207 Bytes	2022-11-5 18:11:04
AC	colin1112 (墙凌可)	15ms	440 KiB		276 Bytes	2023-3-11 15:00:20
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	15ms	440 KiB		207 Bytes	2022-3-2 18:52:04
AC	杨皓宇 (yanghaoyu)	15ms	6.8 MiB		189 Bytes	2023-10-21 8:48:35
AC	zzy	15ms	512 KiB		274 Bytes	2023-4-8 16:14:49
AC	张宸瑾	15ms	392 KiB		256 Bytes	2022-12-29 19:27:00
AC	Nico	15ms	6.9 MiB		178 Bytes	2023-7-9 10:24:28
AC	时代2校-程俊燃 (chengjunran)	15ms	6.8 MiB		175 Bytes	2023-10-24 20:00:15
AC	11451254188 (22029-mjh)	16ms	408 KiB		224 Bytes	2022-12-3 10:08:14
AC	蓝色妖姬 (jiangpeiyu)	16ms	384 KiB		270 Bytes	2022-10-1 9:49:12
AC	22029-lsl	16ms	384 KiB		224 Bytes	2022-12-3 10:09:18
AC	huanglu	16ms	7.1 MiB		171 Bytes	2023-7-18 9:09:11
AC	pandap&a王皓宸 (WANGHAOCHEN)	16ms	392 KiB		189 Bytes	2022-12-14 19:41:00
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	384 KiB		198 Bytes	2022-12-3 10:18:43
AC	张宸瑾	16ms	384 KiB		256 Bytes	2022-12-29 19:26:49
AC	yanglang	16ms	384 KiB		172 Bytes	2022-10-22 23:08:14