[NOIP2011普及组]数字反转

状态	递交者	时间	内存	语言	代码	递交时间
AC	彭嘉豪 (pengjiahao)	13ms	440 KiB		225 Bytes	2022-7-29 12:40:04
AC	赵泳鑫 (zhaoyongxin)	13ms	440 KiB		223 Bytes	2022-3-5 18:15:14
AC	朱泽晟	13ms	384 KiB		3.1 KiB	2022-1-3 16:50:07
AC	杨洋	13ms	7.1 MiB	C++98	201 Bytes	2024-5-9 18:37:55
AC	谢博文	13ms	512 KiB		183 Bytes	2022-2-13 11:02:10
AC	甄一阳 (22016-zyy)	13ms	448 KiB		238 Bytes	2023-5-14 8:56:11
AC	杜是贤 (dushixian)	13ms	512 KiB		317 Bytes	2022-4-19 19:40:52
AC	_PXY_	13ms	384 KiB		182 Bytes	2022-1-25 14:37:13
AC	时代一校林星宇 (lxy)	14ms	512 KiB		147 Bytes	2023-2-2 19:53:08
AC	罗晨睿 (luochenrui)	14ms	424 KiB		156 Bytes	2022-6-29 13:22:10
AC	cola	14ms	412 KiB		305 Bytes	2023-2-15 13:51:25
AC	17779	14ms	384 KiB		160 Bytes	2022-3-8 20:52:39
AC	源著校区陈锐霖 (13983855850)	14ms	7 MiB	C++11	173 Bytes	2024-8-25 11:11:43
AC	张景豪	14ms	392 KiB		167 Bytes	2023-4-1 19:24:56
AC	文硕 (文硕1)	14ms	448 KiB		212 Bytes	2022-2-6 13:52:15
AC	徐子恩 (Cow)	14ms	440 KiB		162 Bytes	2022-4-10 9:36:47
AC	MoonLight ( aaa)	14ms	392 KiB		387 Bytes	2022-1-3 17:51:44
AC	陈雨泽1	14ms	440 KiB		245 Bytes	2023-2-18 11:16:59
AC	heyi	14ms	6.8 MiB	C++98(O2)	204 Bytes	2024-8-9 13:46:21
AC	xxteacher	14ms	416 KiB		331 Bytes	2022-2-12 11:52:12
AC	CK (李弘毅)	14ms	512 KiB		156 Bytes	2022-9-24 16:49:46
AC	贾鑫豪 (Mr Sam)	14ms	512 KiB		172 Bytes	2022-3-3 6:38:52
AC	王重道	14ms	428 KiB		175 Bytes	2022-4-16 15:28:59
AC	My name is Man (钟卓劭)	14ms	6.8 MiB	C++98	148 Bytes	2024-6-16 12:50:26
AC	姚宏逸	14ms	392 KiB		509 Bytes	2022-2-15 12:28:56
AC	唐良瑞 (22016-tlr01)	14ms	428 KiB		141 Bytes	2023-5-13 9:57:02
AC	姚宏逸	14ms	512 KiB		509 Bytes	2022-2-15 12:27:20
AC	陈杰晟	14ms	424 KiB		314 Bytes	2023-2-15 13:48:57
AC	scallway1	14ms	436 KiB		355 Bytes	2022-8-21 11:24:56
AC	huanglu	14ms	436 KiB		181 Bytes	2023-4-8 22:55:54
AC	李书翰 (lishuhan)	14ms	448 KiB		353 Bytes	2022-2-14 17:42:42
AC	时代2校-程俊燃 (chengjunran)	14ms	7.1 MiB		186 Bytes	2023-6-29 19:17:14
AC	况奕辛 (KYX_yyds)	14ms	452 KiB		225 Bytes	2022-2-25 20:52:30
AC	22029-zjs	14ms	384 KiB		195 Bytes	2022-11-19 11:31:37
AC	张玉坚 (zhangyuian)	14ms	384 KiB		182 Bytes	2022-10-23 14:48:40
AC	soha (武夷岩)	14ms	6.8 MiB		347 Bytes	2023-6-10 15:57:00
AC	SYC0226	14ms	408 KiB		176 Bytes	2022-3-20 11:05:43
AC	王浚西 (22016-wjx)	14ms	512 KiB		174 Bytes	2023-5-13 20:00:46
AC	luoluonuoya	14ms	384 KiB		559 Bytes	2022-8-28 17:58:27
AC	姚宏逸	14ms	384 KiB		181 Bytes	2022-11-19 11:46:23
AC	yang	14ms	428 KiB		632 Bytes	2022-8-14 19:40:17
AC	我是周靖松长得帅 (mouyunqi)	14ms	384 KiB		205 Bytes	2023-3-17 19:21:13
AC	潘光瑞 (NB牛牛大师)	14ms	436 KiB		172 Bytes	2022-8-11 11:02:57
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	6.9 MiB		216 Bytes	2023-7-12 19:02:47
AC	孙烽轶 (sfy)	14ms	512 KiB		168 Bytes	2022-9-24 16:47:20
AC	杨瀚霖 (yanghanlin)	14ms	6.7 MiB		200 Bytes	2023-6-9 15:39:04
AC	芒苒忧 (廖迦南)	14ms	432 KiB		240 Bytes	2022-2-26 9:30:58
AC	时代一校-曾科智 (曾科智)	14ms	512 KiB		245 Bytes	2023-3-4 18:34:18
AC	zjz	14ms	392 KiB		524 Bytes	2022-1-25 10:14:17
AC	乐瀚阳 (yuehanyang)	14ms	6.8 MiB		242 Bytes	2023-6-10 16:05:29
AC	蒲梓勋 (puzixun)	14ms	432 KiB		184 Bytes	2022-8-12 17:47:29
AC	谭懿轩 (yanyixuan)	14ms	432 KiB		150 Bytes	2022-2-19 8:49:30
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	14ms	6.8 MiB		307 Bytes	2023-6-8 20:47:39
AC	马渝杭 (mayuhang)	14ms	440 KiB		162 Bytes	2022-8-22 12:09:42
AC	王晴萱	14ms	7 MiB		180 Bytes	2023-7-13 14:51:44
AC	SB (mfy01)	14ms	444 KiB		166 Bytes	2023-2-3 17:35:15
AC	xxteacher	14ms	392 KiB		334 Bytes	2022-2-12 11:50:17
AC	^_^ (ctc)	14ms	440 KiB		239 Bytes	2022-10-26 20:38:13
AC	任瑞的学生 (jiangyadong)	14ms	384 KiB		165 Bytes	2022-6-19 10:58:40
AC	pandap&a王皓宸 (WANGHAOCHEN)	15ms	392 KiB		356 Bytes	2022-12-31 11:42:46
AC	小忙果 (王昱杰)	15ms	7.1 MiB		165 Bytes	2023-7-18 9:20:36
AC	王祎辰 (wangyichen)	15ms	384 KiB		164 Bytes	2023-4-1 19:25:39
AC	源著+王新睿 (王新睿)	15ms	6.9 MiB		211 Bytes	2023-7-27 10:03:44
AC	时代一校-赵彦博 (zyb)	15ms	384 KiB		153 Bytes	2023-2-12 10:55:02
AC	12345	15ms	436 KiB		415 Bytes	2022-8-9 9:07:02
AC	zcx	15ms	384 KiB		153 Bytes	2022-11-19 11:31:21
AC	Jose (反恐皮蛋)	15ms	512 KiB		388 Bytes	2023-4-28 15:28:45
AC	22029-lsl	15ms	384 KiB		156 Bytes	2022-11-19 11:18:32
AC	源著校区-宋昊成 (马冬梅)	15ms	444 KiB		229 Bytes	2023-2-25 18:16:07
AC	程子杰 (05c41-czj)	15ms	512 KiB		177 Bytes	2022-7-27 10:42:21
AC	刘政君 (lzj)	15ms	432 KiB		168 Bytes	2022-8-31 13:06:06
AC	郑尧 (zhengyao)	15ms	388 KiB		167 Bytes	2023-4-1 19:24:44
AC	李林峰 (金克拉)	15ms	512 KiB		129 Bytes	2023-2-18 9:47:50
AC	22029-lyh	15ms	512 KiB		183 Bytes	2022-11-19 11:10:29
AC	呵呵呵 (陈思琦)	15ms	384 KiB		184 Bytes	2022-9-24 16:47:47
AC	zhm123	15ms	440 KiB		154 Bytes	2023-3-30 15:42:50
AC	dmh (丁墨涵)	15ms	444 KiB		156 Bytes	2022-1-18 11:24:24
AC	李彭宋代诗人 (ljy123456)	15ms	444 KiB		367 Bytes	2023-3-27 20:38:26
AC	wuqi	15ms	6.9 MiB		359 Bytes	2023-8-1 17:15:37
AC	22029-hqh	15ms	436 KiB		192 Bytes	2022-11-19 11:54:36
AC	xuniaoyin (徐袅音)	15ms	6.9 MiB		237 Bytes	2023-7-23 14:31:49
AC	Jack	15ms	428 KiB		247 Bytes	2023-3-22 20:34:32
AC	https://www.minecraft.net/zh-hans (王振西)	15ms	384 KiB		203 Bytes	2023-6-3 11:12:40
AC	yanglang	15ms	436 KiB		257 Bytes	2022-10-22 20:55:38
AC	时代二校-焦雨齐 (Angel)	15ms	6.9 MiB		170 Bytes	2023-6-29 18:08:04
AC	新壹街校区-杨轩懿 (杨轩懿1)	15ms	7.1 MiB		202 Bytes	2023-12-30 12:14:29
AC	彭崇鑫	15ms	512 KiB		169 Bytes	2022-9-24 16:48:22
AC	Nico	15ms	432 KiB		203 Bytes	2023-4-16 14:44:32
AC	UsMt1 (jiangyuan)	15ms	6.9 MiB		292 Bytes	2023-7-28 11:07:53
AC	Jack	15ms	448 KiB		386 Bytes	2023-3-22 20:11:40
AC	chenxiyu	15ms	6.8 MiB		294 Bytes	2023-6-10 16:00:51
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)	15ms	512 KiB		222 Bytes	2022-11-19 11:43:13
AC	爱琴海校区jzn (jzn)	15ms	6.8 MiB		225 Bytes	2023-7-3 21:23:51
AC	暗蛆突围 (lzh)	15ms	7 MiB		292 Bytes	2023-12-28 18:23:43
AC	李艾芯 (starry sky)	15ms	384 KiB		565 Bytes	2022-7-10 10:51:50
AC	张雯皓 (zhangwenhao)	15ms	6.9 MiB		166 Bytes	2023-7-15 8:53:28
AC	马渝杭 (mayuhang)	15ms	440 KiB		203 Bytes	2023-3-17 19:21:09
AC	坤坤荔枝小黑子 (zhonghaotian22006)	15ms	432 KiB		345 Bytes	2022-11-20 16:11:12
AC	我是个s* (lijinze)	15ms	444 KiB		173 Bytes	2023-3-17 19:28:25
AC	wzzjnb2012	15ms	440 KiB		406 Bytes	2022-9-30 16:16:30