输出第二个整数

状态	递交者	时间	内存	代码	递交时间
AC	李旻轩	13ms	512 KiB	174 Bytes	2023-2-4 11:19:55
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	13ms	384 KiB	125 Bytes	2022-11-10 20:04:28
AC	汪致卉 (wangzh)	13ms	392 KiB	417 Bytes	2022-4-8 19:04:23
AC	叶令子	13ms	6.8 MiB	113 Bytes	2023-10-30 19:28:51
AC	李山水	13ms	512 KiB	160 Bytes	2022-2-19 10:46:28
AC	爱琴海校区-刁钲洋 (刁钲洋)	13ms	384 KiB	100 Bytes	2022-11-27 15:02:19
AC	爱琴海校区-王宥喆 (王宥喆)	13ms	6.9 MiB	155 Bytes	2023-7-5 19:25:10
AC	caijunjie23017	13ms	6.7 MiB	135 Bytes	2023-9-2 20:09:53
AC	laiyouming22031	13ms	384 KiB	117 Bytes	2022-9-25 11:23:45
AC	tangchunxiang	13ms	384 KiB	118 Bytes	2022-9-25 11:25:48
AC	邵冠铖 (shaoguancheng22031)	13ms	384 KiB	114 Bytes	2022-9-25 11:21:48
AC	zhoumingze23017	13ms	6.7 MiB	127 Bytes	2023-8-31 10:41:38
AC	dinghaoyan1	13ms	384 KiB	149 Bytes	2022-9-7 20:07:00
AC	苏晨懿	13ms	6.8 MiB	123 Bytes	2023-10-26 21:50:44
AC	huanghaoming	13ms	512 KiB	136 Bytes	2022-8-18 11:23:17
AC	wanghuaiying	13ms	6.7 MiB	116 Bytes	2023-9-16 9:54:03
AC	xiangsiyu	13ms	436 KiB	121 Bytes	2022-7-23 7:08:10
AC	dinghaoyan1	13ms	384 KiB	149 Bytes	2022-9-7 19:52:14
AC	炸鱼4000+ (dxc)	13ms	392 KiB	113 Bytes	2023-1-15 19:59:04
AC	潘佑实	13ms	396 KiB	134 Bytes	2022-10-30 15:22:36
AC	冯若涵	13ms	6.8 MiB	122 Bytes	2023-10-14 10:32:36
AC	zhangjunming22031	13ms	384 KiB	122 Bytes	2022-9-25 11:31:57
AC	你猜呀	13ms	512 KiB	104 Bytes	2023-2-12 15:24:54
AC	潘佑实	13ms	384 KiB	134 Bytes	2022-10-30 15:22:24
AC	正常的雪糕	13ms	440 KiB	96 Bytes	2023-2-11 12:00:27
AC	dinghaoyan1	13ms	384 KiB	149 Bytes	2022-9-7 20:07:00
AC	zhuyumin23017	13ms	6.7 MiB	153 Bytes	2023-9-2 20:07:09
AC	JOKER (hhy)	13ms	384 KiB	115 Bytes	2023-4-8 11:36:41
AC	彭嘉豪 (pengjiahao)	13ms	384 KiB	101 Bytes	2022-6-26 10:15:20
AC	月下的九尾银狐	13ms	392 KiB	133 Bytes	2023-2-18 10:06:55
AC	田世瑞	13ms	420 KiB	150 Bytes	2022-10-30 15:26:39
AC	王锦锐 (wjr)	13ms	6.7 MiB	114 Bytes	2023-8-25 14:45:43
AC	陈策cc	13ms	6.7 MiB	157 Bytes	2023-8-29 16:48:20
AC	17783879785	13ms	392 KiB	130 Bytes	2022-9-10 11:59:22
AC	sunsihan	13ms	384 KiB	185 Bytes	2022-11-5 11:47:29
AC	zhaojunjie22031	13ms	400 KiB	102 Bytes	2022-9-25 11:21:45
AC	e^(i×π)+1=0	13ms	6.7 MiB	110 Bytes	2023-8-27 8:56:51
AC	wangzihan	13ms	392 KiB	114 Bytes	2022-10-30 15:01:59
AC	炸鱼4000+ (dxc)	13ms	384 KiB	113 Bytes	2023-1-15 19:59:08
AC	龙湖源著校区郑皓铭 (郑皓铭)	13ms	432 KiB	137 Bytes	2023-5-14 15:57:38
AC	炸鱼4000+ (dxc)	13ms	384 KiB	113 Bytes	2023-1-15 19:59:09
AC	(-v-)ikun ((-v-))	13ms	512 KiB	114 Bytes	2022-9-11 14:22:41
AC	炸鱼4000+ (dxc)	13ms	384 KiB	113 Bytes	2023-1-15 19:59:09
AC	许嘉恩 (xje22031)	13ms	440 KiB	124 Bytes	2022-11-9 22:22:16
AC	Aphrode	13ms	6.8 MiB	119 Bytes	2023-6-20 16:43:30
AC	dream	13ms	6.7 MiB	120 Bytes	2023-8-21 20:27:30
AC	zhangxinyue	13ms	384 KiB	126 Bytes	2022-11-5 11:32:38
AC	李山水	13ms	392 KiB	160 Bytes	2022-2-19 10:46:29
AC	老六（王牌） (mhc)	13ms	384 KiB	106 Bytes	2023-3-29 19:22:59
AC	zhongjunxuan	13ms	6.9 MiB	116 Bytes	2023-6-17 19:56:26
AC	杨淇瑞 (杨淇瑞29)	13ms	440 KiB	122 Bytes	2023-4-17 20:56:44
AC	Error404sans (焦阳浩云)	13ms	6.9 MiB	114 Bytes	2023-6-30 21:07:32
AC	徐康景 (dcm)	13ms	384 KiB	108 Bytes	2022-8-21 21:47:54
AC	dinghaoyan1	13ms	396 KiB	149 Bytes	2022-9-7 20:07:01
AC	月下的九尾银狐	13ms	440 KiB	133 Bytes	2023-2-18 10:04:39
AC	laiyouming22031	13ms	512 KiB	117 Bytes	2022-9-25 11:24:19
AC	river	13ms	392 KiB	121 Bytes	2022-10-9 17:00:41
AC	我是** (zhuyubing)	13ms	384 KiB	133 Bytes	2022-11-5 11:22:37
AC	江政含	13ms	6.9 MiB	131 Bytes	2023-7-5 19:27:59
AC	炸鱼4000+ (dxc)	13ms	392 KiB	113 Bytes	2023-1-15 19:58:47
AC	刘老师 (图书管理员)	13ms	440 KiB	149 Bytes	2022-8-7 15:05:06
AC	爱琴海校区-刁钲洋 (刁钲洋)	13ms	404 KiB	100 Bytes	2022-11-28 20:40:24
AC	李禹衡 (liyuheng22006)	13ms	384 KiB	116 Bytes	2022-9-27 18:44:42
AC	刘煜轩	13ms	6.7 MiB	116 Bytes	2023-9-23 20:53:45
AC	任希贤	13ms	420 KiB	101 Bytes	2023-3-17 16:14:14
AC	许炜铭 (xuweiming)	13ms	6.7 MiB	113 Bytes	2023-9-17 9:02:28
AC	周米骐 (zsb)	13ms	7.1 MiB	104 Bytes	2023-7-18 11:37:31
AC	罗伟杰 (13308275065)	13ms	436 KiB	155 Bytes	2023-2-16 21:44:58
AC	wangziji	13ms	440 KiB	99 Bytes	2023-3-18 9:07:35
AC	郑尧 (zhengyao)	13ms	7.5 MiB	113 Bytes	2023-6-29 20:43:46
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)	13ms	432 KiB	122 Bytes	2022-9-23 19:59:40
AC	陈嘉熠	13ms	428 KiB	155 Bytes	2023-1-1 18:12:38
AC	dengbowen23017	13ms	6.7 MiB	173 Bytes	2023-9-2 20:05:20
AC	pandap&a王皓宸 (WANGHAOCHEN)	14ms	440 KiB	108 Bytes	2022-11-5 10:47:24
AC	六 (江智昕)	14ms	384 KiB	143 Bytes	2022-11-5 11:25:51
AC	jighghjkfkhfdhdfdfdsfsdfsafvmnkbnkbmnlvnmkbvnvb;,.m;,;.;,;kbvlmkbnlmkblnvkmlbnkmlbvkmlbvklmbkmlkblmbnm;,l.,.;,'.,';.[',;.[,kjkoihgfhfgiohifgohifgohiofgihgofhiofgihofgihofgihofgiho;''[;.',m;.',m.;',.;'m,.;';'cv;x'cb'cx;b'cv;b'xc;b'c;b'cvbvc.'bv.//,/vb./vcb./cvbv,c.b,cv.,b.cv,b.vc,bg;hgl;hgl;hg;h;hfg;hl;lf;l;lxc;cln;bvln;vcln;vnl;vbl;vbln;vlv;blnvb;plnp;lplhfljpjh;nlvb;nv;bn;vcvl;nlv;nlv;g;hjhchl;ghfghl;fghl;ltlh;l;hlf;lg;bnlc;;nlv;nbv;nbv;nvb;nlvcnl;xc;blxcb;ll;hg;lhgl;dfl;t;ldy;l;lyl;rewlt493;l;dl;dsflg;lsdlpbpcxobpocvbpopopopreopotpreotertertretert (litingxu)	14ms	444 KiB	131 Bytes	2023-3-19 18:29:46
AC	何镇西1	14ms	6.9 MiB	125 Bytes	2023-7-27 17:54:06
AC	Guest	14ms	6.8 MiB	114 Bytes	2023-9-24 18:27:11
AC	陈杞炘	14ms	384 KiB	156 Bytes	2022-10-30 15:35:43
AC	喻琦皓1	14ms	6.8 MiB	103 Bytes	2023-10-14 9:57:15
AC	yyds (杨骐嘉)	14ms	440 KiB	120 Bytes	2022-12-4 19:47:32
AC	刘昊臻 (liuhaozhen)	14ms	432 KiB	112 Bytes	2023-2-21 20:09:10
AC	yuchenyi23017	14ms	6.7 MiB	150 Bytes	2023-9-2 20:05:43
AC	刘蕤箎	14ms	440 KiB	97 Bytes	2023-2-19 14:55:24
AC	朱老师 (zyp)	14ms	6.7 MiB	156 Bytes	2023-9-2 20:03:07
AC	陈玺宇	14ms	6.7 MiB	113 Bytes	2023-8-29 17:40:22
AC	高国瑞	14ms	6.7 MiB	115 Bytes	2023-8-30 10:00:11
AC	雷文博（帅哥） (18983951391)	14ms	420 KiB	118 Bytes	2023-4-13 19:42:16
AC	关博源	14ms	444 KiB	119 Bytes	2023-2-21 19:48:32
AC	444444444 (唐跃元)	14ms	6.7 MiB	108 Bytes	2023-8-29 14:17:27
AC	Nico	14ms	444 KiB	120 Bytes	2022-12-23 15:45:01
AC	明哲瀚 (18580067605)	14ms	512 KiB	153 Bytes	2022-9-8 19:08:22
AC	U城校区-董思羽 (董思羽)	14ms	6.9 MiB	116 Bytes	2023-7-28 19:39:38
AC	叶雨昊 (yeyuhao22006)	14ms	512 KiB	114 Bytes	2022-10-15 11:51:56
AC	冉宸语	14ms	392 KiB	134 Bytes	2022-10-30 15:07:57
AC	0721 (龙浩恩)	14ms	6.9 MiB	120 Bytes	2023-10-28 16:32:11
AC	明哲瀚 (18580067605)	14ms	392 KiB	155 Bytes	2022-9-7 19:40:06
AC	炸鱼4000+ (dxc)	14ms	404 KiB	113 Bytes	2023-1-15 19:59:10
AC	tangchunxiang	14ms	384 KiB	118 Bytes	2022-9-25 11:25:47
AC	张峻熙	14ms	392 KiB	113 Bytes	2022-10-31 21:10:39