输出自然数

状态	递交者	时间	内存	语言	代码	递交时间
AC	许徐非凡 (非同凡响)	16ms	392 KiB		116 Bytes	2022-10-27 20:19:07
AC	张月恒	16ms	6.9 MiB	C++98(O2)	155 Bytes	2024-5-26 18:05:27
AC	56 (13883454928)	16ms	440 KiB		141 Bytes	2022-2-13 18:34:24
AC	时代一校-曾科智 (曾科智)	16ms	432 KiB		167 Bytes	2023-2-25 19:42:03
AC	胡程禹	16ms	384 KiB		162 Bytes	2023-3-18 19:31:34
AC	六 (江智昕)	16ms	436 KiB		169 Bytes	2023-2-9 19:34:30
AC	陈廷恩	16ms	6.9 MiB		140 Bytes	2023-10-13 20:15:05
AC	陈思博	16ms	768 KiB		207 Bytes	2022-1-20 19:46:51
AC	谁陪訫牞（杀手） (22029-zys)	16ms	444 KiB		106 Bytes	2022-10-24 22:04:56
AC	唐翰	16ms	6.8 MiB	C++98	130 Bytes	2024-8-6 11:41:52
AC	zhouzipu	16ms	672 KiB		293 Bytes	2022-8-17 15:02:37
AC	孙烽轶 (sfy)	16ms	424 KiB		129 Bytes	2023-2-18 15:08:25
AC	时代2校-程俊燃 (chengjunran)	16ms	436 KiB		162 Bytes	2023-4-8 20:30:01
AC	CK (李弘毅)	16ms	6.9 MiB		201 Bytes	2023-10-21 19:51:42
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	16ms	512 KiB		145 Bytes	2022-7-21 15:36:01
AC	徐正旺 (xzw)	16ms	7 MiB		191 Bytes	2023-7-15 15:55:26
AC	向俊熙 (xiangjunxi23003)	16ms	6.9 MiB		121 Bytes	2023-7-28 15:19:37
AC	炸鱼4000+ (dxc)	16ms	384 KiB		153 Bytes	2023-3-8 20:41:53
AC	05c05-hzy	16ms	444 KiB		121 Bytes	2023-3-5 10:11:40
AC	靳博然 (jbr)	16ms	432 KiB		146 Bytes	2023-3-19 17:32:42
AC	梁金同 (liangjintong)	16ms	512 KiB		235 Bytes	2023-3-5 14:56:30
AC	lby_joey	16ms	6.6 MiB	C++98(O2)	124 Bytes	2024-7-16 14:01:44
AC	Microsoft (hu_moren)	16ms	6.9 MiB	C++98	165 Bytes	2024-8-24 16:35:12
AC	黄立信	16ms	6.9 MiB		151 Bytes	2023-8-18 15:09:26
AC	陈杰晟	16ms	436 KiB		162 Bytes	2022-2-22 13:13:14
AC	赵彬鸿	16ms	512 KiB		148 Bytes	2022-8-13 11:08:59
AC	kkksc03 (彭士锋)	16ms	440 KiB		186 Bytes	2022-3-11 18:12:49
AC	赵启程 (赵启程1)	16ms	384 KiB		130 Bytes	2023-3-18 19:27:56
AC	罗宇凡 (吴彦祖)	16ms	392 KiB		137 Bytes	2022-2-20 12:16:27
AC	黄梓轩 (huangzixuan)	16ms	440 KiB		158 Bytes	2022-12-3 16:23:04
AC	yanxiaosong	16ms	384 KiB		137 Bytes	2022-11-5 14:01:30
AC	啊...这 (炼狱杏寿郎)	16ms	440 KiB		143 Bytes	2022-7-2 10:52:55
AC	繁星 (05c35-zzm)	16ms	384 KiB		155 Bytes	2022-10-23 9:28:35
AC	谁陪訫牞（杀手） (22029-zys)	16ms	436 KiB		119 Bytes	2023-1-4 17:33:15
AC	六 (江智昕)	16ms	384 KiB		169 Bytes	2023-2-9 19:34:31
AC	叶令子	16ms	6.7 MiB		127 Bytes	2023-8-26 22:10:58
AC	王昱祺 (12王昱祺)	16ms	6.8 MiB		148 Bytes	2023-10-29 16:28:18
AC	huanglu	16ms	7.1 MiB		143 Bytes	2023-7-15 16:07:56
AC	除了我全部人都是SB (车涌樯)	16ms	6.9 MiB		140 Bytes	2023-7-18 15:31:55
AC	xiangsiyu	16ms	440 KiB		156 Bytes	2022-6-26 9:13:16
AC	zhangyouze (张佑泽)	16ms	6.9 MiB		151 Bytes	2023-10-21 18:14:22
AC	李旻轩	16ms	392 KiB		156 Bytes	2023-3-25 11:31:40
AC	贾博涵	16ms	6.8 MiB		122 Bytes	2023-11-8 11:36:09
AC	赵彬鸿	16ms	392 KiB		148 Bytes	2022-8-13 11:08:57
AC	王胤钦 (wangyinqin)	16ms	512 KiB		123 Bytes	2022-4-23 15:42:53
AC	况奕辛 (KYX_yyds)	16ms	436 KiB		164 Bytes	2022-2-25 20:12:19
AC	吕淼 (05c41-lm)	16ms	436 KiB		151 Bytes	2022-3-5 12:24:16
AC	金海童1	16ms	6.8 MiB		154 Bytes	2023-11-3 17:57:46
AC	煞笔笔	16ms	6.9 MiB		123 Bytes	2023-11-28 19:39:13
AC	杨淇瑞 (杨淇瑞29)	16ms	6.7 MiB		156 Bytes	2023-9-17 16:53:10
AC	六 (江智昕)	16ms	392 KiB		169 Bytes	2023-2-9 19:34:30
AC	坤坤打篮球	16ms	636 KiB		223 Bytes	2022-10-16 8:57:29
AC	执剑人罗辑 (Jasson)	16ms	384 KiB		126 Bytes	2023-1-10 13:59:37
AC	六 (江智昕)	16ms	392 KiB		169 Bytes	2023-2-9 19:34:29
AC	苏信泽	16ms	436 KiB		129 Bytes	2023-3-18 19:30:43
AC	Nico	16ms	444 KiB		162 Bytes	2023-3-28 17:25:55
AC	zhm123	16ms	512 KiB		236 Bytes	2023-3-3 16:13:28
AC	miku (阳沐珊)	16ms	392 KiB		155 Bytes	2023-3-23 17:34:44
AC	yanglang	16ms	432 KiB		129 Bytes	2022-10-21 23:31:40
AC	周子涵	16ms	384 KiB		127 Bytes	2022-10-1 15:00:21
AC	22029-zjs	16ms	384 KiB		164 Bytes	2022-10-29 12:04:38
AC	xiongxinyao	16ms	420 KiB		196 Bytes	2022-10-21 19:55:16
AC	张峻熙	16ms	416 KiB		136 Bytes	2022-10-16 8:17:59
AC	章愉霖	16ms	436 KiB		161 Bytes	2023-6-1 11:03:57
AC	黄誉翔 (黄誉翔)	16ms	440 KiB		117 Bytes	2022-10-15 22:21:03
AC	杨瀚霖 (yanghanlin)	16ms	384 KiB		137 Bytes	2022-12-30 17:22:16
AC	六 (江智昕)	16ms	640 KiB		169 Bytes	2023-2-9 19:34:22
AC	jdy	16ms	640 KiB		250 Bytes	2022-12-3 13:43:46
AC	lizirui0501	16ms	420 KiB		183 Bytes	2023-3-11 17:14:13
AC	呵呵呵 (陈思琦)	16ms	512 KiB		129 Bytes	2022-12-3 16:33:25
AC	ycy	16ms	512 KiB		142 Bytes	2022-12-30 17:19:48
AC	赵彬鸿	16ms	392 KiB		148 Bytes	2022-8-13 11:09:03
AC	毕浩宇 (bihaoyu)	16ms	512 KiB		129 Bytes	2023-3-23 19:15:37
AC	22029-lyh	16ms	384 KiB		121 Bytes	2022-10-23 12:43:56
AC	amr (董子溪)	16ms	7.1 MiB		190 Bytes	2024-1-7 15:54:48
AC	新壹街校区-陈琬舒 (空空大师)	16ms	6.9 MiB		194 Bytes	2023-7-27 14:56:05
AC	在煎鱼的肖大总铳 (肖宇航)	16ms	6.8 MiB		168 Bytes	2023-9-24 11:04:33
AC	科比.布莱恩特 (董浩琰)	16ms	384 KiB		139 Bytes	2023-3-18 19:32:08
AC	ttt123	16ms	432 KiB		164 Bytes	2023-1-4 17:26:51
AC	yuhaodi	17ms	432 KiB		160 Bytes	2023-4-24 18:40:31
AC	SB (mfy01)	17ms	512 KiB		164 Bytes	2022-12-2 13:46:10
AC	刘蕤箎	17ms	6.9 MiB		130 Bytes	2023-8-7 16:28:04
AC	zhangheyi22006	17ms	420 KiB		131 Bytes	2022-10-30 16:40:13
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)	17ms	512 KiB		181 Bytes	2022-10-23 15:03:01
AC	曾龙兮	17ms	640 KiB		172 Bytes	2023-1-8 19:02:41
AC	郑尧 (zhengyao)	17ms	7 MiB		145 Bytes	2023-6-29 20:54:26
AC	朱老师 (zyp)	17ms	700 KiB		219 Bytes	2022-10-30 18:18:35
AC	(金沙天街)严皓月 (严皓月)	17ms	384 KiB		153 Bytes	2022-11-3 20:01:11
AC	11451254188 (22029-mjh)	17ms	384 KiB		146 Bytes	2022-10-29 11:33:36
AC	wuqi	17ms	6.9 MiB		247 Bytes	2023-7-24 16:34:45
AC	老六（王牌） (mhc)	17ms	424 KiB		160 Bytes	2023-3-23 20:18:56
AC	江坤锜	17ms	384 KiB		168 Bytes	2023-3-18 19:29:13
AC	余晨浩 (yuchenhao)	17ms	6.8 MiB		220 Bytes	2023-8-31 14:56:38
AC	罗伟杰 (13308275065)	17ms	436 KiB		151 Bytes	2022-11-30 21:56:29
AC	yxj	17ms	440 KiB		164 Bytes	2022-10-20 15:40:46
AC	soha (武夷岩)	17ms	512 KiB		145 Bytes	2022-12-3 16:34:52
AC	Noah (mwx)	17ms	6.8 MiB		288 Bytes	2023-6-11 16:20:28
AC	xuniaoyin (徐袅音)	17ms	6.7 MiB		150 Bytes	2023-8-27 11:23:40
AC	ttt123	17ms	432 KiB		158 Bytes	2022-12-4 20:16:02
AC	赵彬鸿	17ms	440 KiB		148 Bytes	2022-8-13 11:08:49