「程序2-1」输出1，2，3，…，n的值

状态	递交者	时间	内存	语言	代码	递交时间
AC	李哲 (lizhe)	10ms	256 KiB		124 Bytes	2022-7-2 22:08:09
AC	姚宏逸	11ms	316 KiB		125 Bytes	2022-5-18 19:14:48
AC	赵沛喆	11ms	256 KiB		151 Bytes	2022-4-3 9:59:55
AC	姚宏逸	11ms	292 KiB		125 Bytes	2022-4-5 22:01:15
AC	SMIK	11ms	316 KiB		146 Bytes	2022-1-19 13:16:05
AC	陈雨泽1	13ms	316 KiB		147 Bytes	2023-2-18 11:19:44
AC	胡宸华 (huchenhua)	13ms	312 KiB		128 Bytes	2022-11-6 14:12:36
AC	靳博然 (jbr)	17ms	384 KiB		147 Bytes	2023-4-2 17:34:35
AC	zlx (xiao)	17ms	444 KiB		166 Bytes	2022-5-25 19:51:21
AC	傅翊航 (fyh)	17ms	436 KiB		194 Bytes	2022-7-28 20:06:51
AC	赵泳鑫 (zhaoyongxin)	17ms	408 KiB		161 Bytes	2022-4-24 19:03:37
AC	王晨志 (wangchenzhi)	17ms	392 KiB		167 Bytes	2022-5-28 21:18:54
AC	文硕 (文硕1)	18ms	436 KiB		171 Bytes	2022-7-12 11:32:21
AC	李山水	18ms	512 KiB		197 Bytes	2022-2-19 15:06:45
AC	胡颖彤	18ms	7 MiB	C++98	134 Bytes	2024-6-9 13:30:38
AC	郑尧 (zhengyao)	18ms	6.7 MiB	C++98	151 Bytes	2024-8-2 20:25:30
AC	xzf	18ms	6.7 MiB		209 Bytes	2023-9-24 16:37:40
AC	朱老师 (zyp)	18ms	512 KiB		146 Bytes	2022-8-6 10:05:28
AC	吴俊成 (wujuncheng)	18ms	512 KiB		169 Bytes	2022-7-9 22:26:49
AC	偽艺術家 (chenyanchi22006)	18ms	436 KiB		149 Bytes	2022-6-23 21:47:01
AC	Nico	18ms	512 KiB		147 Bytes	2023-4-16 14:46:28
AC	李山水	19ms	512 KiB		197 Bytes	2022-2-19 15:06:44
AC	雷诺伊尔 (崔金鹏)	19ms	6.6 MiB	C++98	146 Bytes	2024-7-17 11:31:05
AC	朱泽晟	19ms	384 KiB		147 Bytes	2022-2-13 11:12:11
AC	zzl	19ms	6.8 MiB		147 Bytes	2023-11-7 0:33:51
AC	何洋名 (heyangming)	19ms	444 KiB		139 Bytes	2022-3-11 16:29:52
AC	源著校区-宋昊成 (马冬梅)	19ms	440 KiB		170 Bytes	2023-2-25 18:18:39
AC	新壹街校区-周士杰 (zsj)	19ms	6.7 MiB		136 Bytes	2023-9-2 21:05:49
AC	xzf	19ms	6.9 MiB		187 Bytes	2023-11-4 20:23:19
AC	炸鱼4000+ (dxc)	20ms	7.1 MiB		134 Bytes	2023-11-14 21:26:41
AC	王乐仪	20ms	436 KiB		139 Bytes	2022-2-17 19:09:50
AC	Tender. (05c05-zhou)	20ms	388 KiB		139 Bytes	2022-6-3 19:35:01
AC	wuzhenghan	21ms	512 KiB		148 Bytes	2022-11-5 18:30:04
AC	yanglang	21ms	444 KiB		136 Bytes	2022-10-22 21:14:13
AC	曹埊睿 (caodirui)	21ms	436 KiB		141 Bytes	2023-3-26 12:04:16
AC	章愉霖	23ms	6.8 MiB		138 Bytes	2023-6-12 19:49:41
AC	Him (李俊熙)	30ms	7.1 MiB		144 Bytes	2024-1-7 16:08:31
AC	zvt_132 (任子轩)	35ms	6.6 MiB	C++98	166 Bytes	2024-7-24 19:06:43
AC	黄px	37ms	6.9 MiB	C++11	132 Bytes	2024-8-16 14:09:18
AC	程舒然	37ms	6.6 MiB	C++11	141 Bytes	2024-7-12 13:54:05
AC	李彭宋代诗人 (ljy123456)	37ms	384 KiB		139 Bytes	2023-4-11 21:00:22
AC	dyp (hhy)	38ms	6.8 MiB	C++98	400 Bytes	2024-8-6 17:33:26
AC	凌肯 (lingken22006)	38ms	436 KiB		167 Bytes	2022-7-31 21:54:22
AC	cainuoyan	38ms	7 MiB	C++98	127 Bytes	2024-6-16 20:39:18
AC	杨镇宇	38ms	7.3 MiB	C++98	139 Bytes	2024-6-28 16:56:34
AC	heyi	38ms	6.8 MiB	C++98(O2)	151 Bytes	2024-8-9 13:34:43
AC	张瑞博	39ms	7.2 MiB	C++11	142 Bytes	2024-4-20 23:23:58
AC	Guest	39ms	7 MiB	C++98(O2)	139 Bytes	2024-8-24 14:26:36
AC	zyl	39ms	7.3 MiB		140 Bytes	2024-1-4 9:40:31
AC	李安桐23025	39ms	7 MiB		146 Bytes	2024-1-6 22:34:56
AC	老六在此	39ms	6.8 MiB	C++20	170 Bytes	2024-8-12 12:49:40
AC	张瑞博	39ms	6.9 MiB	C++11	147 Bytes	2024-8-17 15:24:47
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	39ms	6.5 MiB	C++98	148 Bytes	2024-7-30 14:56:07
AC	My name is Man (钟卓劭)	39ms	7.2 MiB	C++98	135 Bytes	2024-6-23 14:10:17
AC	heyuzhe	40ms	7 MiB	C++98	176 Bytes	2024-6-12 17:42:44
AC	王冉燚默(重庆龙湖U城天街A馆) (wangranyimo)	40ms	7 MiB	C++98	137 Bytes	2024-5-28 22:31:00
AC	赵彬鸿	40ms	424 KiB		128 Bytes	2022-8-13 14:10:32
AC	黄梓桐 (HuangZiTong)	40ms	444 KiB		134 Bytes	2022-7-11 18:47:52
AC	阮 (媚狐不吃道旁李)	40ms	7 MiB	C++98	145 Bytes	2024-5-25 16:24:03
AC	霍弈丞	40ms	416 KiB		145 Bytes	2022-6-12 16:03:41
AC	xxteacher	40ms	508 KiB		177 Bytes	2022-7-5 18:19:05
AC	周莀熙	40ms	6.9 MiB	C++11	141 Bytes	2024-8-21 17:32:00
AC	源著校区陈锐霖 (13983855850)	40ms	7 MiB	C++11	141 Bytes	2024-8-25 11:23:59
AC	赵彬鸿	40ms	512 KiB		128 Bytes	2022-8-13 14:11:33
AC	潘光瑞 (NB牛牛大师)	40ms	432 KiB		152 Bytes	2022-8-11 11:14:20
AC	77777777	41ms	6.5 MiB	C++17	153 Bytes	2024-7-23 22:40:40
AC	陈骏逸 (chenjunyi)	41ms	440 KiB		129 Bytes	2022-8-4 21:40:41
AC	时代一校 - 冯隆浩 (冯隆浩)	41ms	420 KiB		139 Bytes	2022-7-2 19:22:37
AC	七叶寂照秘密主 (mohaoran)	41ms	388 KiB		150 Bytes	2022-6-17 22:04:40
AC	Erin	41ms	7.2 MiB	C++98	152 Bytes	2024-5-3 21:35:17
AC	啊...这 (炼狱杏寿郎)	41ms	432 KiB		158 Bytes	2022-8-10 16:36:12
AC	老六在此	41ms	6.8 MiB	C++20	170 Bytes	2024-8-12 13:05:39
AC	赵彬鸿	41ms	400 KiB		128 Bytes	2022-8-13 14:10:30
AC	赵彬鸿	41ms	444 KiB		128 Bytes	2022-8-13 14:10:26
AC	邬文博 (wwb)	41ms	400 KiB		139 Bytes	2023-5-7 11:57:19
AC	lch (凌昌瀚)	41ms	424 KiB		136 Bytes	2022-7-8 22:13:32
AC	林子沫awa (linziyue)	41ms	428 KiB		229 Bytes	2022-5-29 15:25:09
AC	王韵淮	41ms	404 KiB		114 Bytes	2022-5-23 21:17:42
AC	刘政君 (lzj)	41ms	432 KiB		135 Bytes	2022-7-8 16:25:57
AC	赵彬鸿	41ms	440 KiB		128 Bytes	2022-8-13 14:11:35
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	41ms	512 KiB		149 Bytes	2022-6-4 13:42:15
AC	Zongzi1	41ms	6.7 MiB	C++17(O2)	139 Bytes	2024-7-17 22:01:41
AC	USSR slq (USSR)	41ms	436 KiB		152 Bytes	2022-5-29 16:10:36
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	42ms	440 KiB		152 Bytes	2022-12-9 13:38:05
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)	42ms	432 KiB		153 Bytes	2023-5-14 18:23:56
AC	icwy (zuolun)	42ms	408 KiB		145 Bytes	2022-6-4 14:21:05
AC	孙烽轶 (sfy)	42ms	6.9 MiB	C++98	125 Bytes	2024-5-25 13:33:33
AC	胡瀚文	42ms	512 KiB		127 Bytes	2022-7-12 16:38:27
AC	赵彬鸿	42ms	408 KiB		128 Bytes	2022-8-13 14:10:35
AC	05c05-yyc	42ms	384 KiB		154 Bytes	2022-6-11 23:04:59
AC	任瑞的学生 (jiangyadong)	42ms	436 KiB		134 Bytes	2022-6-16 14:07:06
AC	yuhaodi	42ms	440 KiB		174 Bytes	2023-5-7 9:00:34
AC	王涵熙 (水煮大肠)	42ms	392 KiB		135 Bytes	2022-5-22 7:43:11
AC	SB (mfy01)	42ms	408 KiB		138 Bytes	2023-2-3 17:36:39
AC	罗伟杰 (13308275065)	42ms	440 KiB		152 Bytes	2023-2-16 21:46:15
AC	GYZ	42ms	424 KiB		157 Bytes	2022-5-22 20:35:06
AC	新一街校区Jason_LuoYouZheng (罗友峥)	42ms	512 KiB		226 Bytes	2022-6-26 11:18:54
AC	马渝杭 (mayuhang)	42ms	444 KiB		139 Bytes	2022-8-11 20:05:40
AC	蒲梓勋 (puzixun)	42ms	512 KiB		138 Bytes	2022-8-9 21:43:19
AC	xiangsiyu	42ms	420 KiB		133 Bytes	2022-6-18 16:03:05