逻辑练习题1

状态	递交者	时间	内存	语言	代码	递交时间
AC	chen (peter)	29ms	512 KiB		158 Bytes	2022-7-19 11:00:53
AC	欧俊阳	29ms	392 KiB		191 Bytes	2022-10-23 17:19:26
AC	刘蕤箎	29ms	384 KiB		148 Bytes	2023-4-17 21:45:07
AC	叶梓珺	29ms	6.8 MiB		153 Bytes	2023-9-17 11:52:32
AC	草\|\|草 (陈星佑)	29ms	384 KiB		193 Bytes	2022-4-23 15:37:59
AC	何星震 (Jacob)	29ms	404 KiB		165 Bytes	2022-10-9 20:27:33
AC	李彦臻	29ms	6.8 MiB		169 Bytes	2023-9-29 14:46:30
AC	苏庭毅	29ms	440 KiB		177 Bytes	2023-3-30 19:13:19
AC	yuqihao	29ms	6.9 MiB		177 Bytes	2023-11-4 10:28:18
AC	liulinqi1	29ms	384 KiB		161 Bytes	2022-10-22 19:38:32
AC	杨淇瑞 (杨淇瑞29)	29ms	6.8 MiB		211 Bytes	2023-10-9 20:01:06
AC	Jose (反恐皮蛋)	29ms	6.8 MiB		194 Bytes	2023-10-8 18:03:35
AC	邵冠铖 (shaoguancheng22031)	29ms	440 KiB		143 Bytes	2022-12-4 12:57:57
AC	张梓浩 (zhangzihao)	29ms	6.8 MiB		146 Bytes	2023-10-14 9:17:34
AC	一片落叶 (yeyuhao)	29ms	6.7 MiB		154 Bytes	2023-8-28 20:17:02
AC	吴攸 (wuyou)	29ms	384 KiB		157 Bytes	2023-3-31 19:16:53
AC	童艺涵	29ms	436 KiB		187 Bytes	2022-12-3 20:13:03
AC	wuqilin	29ms	512 KiB		161 Bytes	2022-9-17 16:58:36
AC	时代一校蒋帛希 (13983392730)	29ms	6.7 MiB		169 Bytes	2023-9-18 21:14:50
AC	刘致言	29ms	384 KiB		180 Bytes	2023-3-11 9:23:40
AC	余多多29	29ms	520 KiB		194 Bytes	2023-4-28 22:51:21
AC	廖永亨	29ms	432 KiB		188 Bytes	2022-12-7 17:46:02
AC	童艺涵	29ms	440 KiB		187 Bytes	2022-12-5 21:24:34
AC	呵呵呵 (陈思琦)	29ms	440 KiB		153 Bytes	2022-9-10 16:41:27
AC	xuniaoyin (徐袅音)	29ms	6.7 MiB		618 Bytes	2023-9-10 10:28:13
AC	heyi	29ms	6.8 MiB	C++98(O2)	153 Bytes	2024-8-8 18:00:55
AC	huanglu	29ms	7 MiB		196 Bytes	2023-7-15 14:43:31
AC	56 (13883454928)	29ms	508 KiB		170 Bytes	2023-4-30 15:01:49
AC	杨颂恩 (yangsongen)	29ms	448 KiB		162 Bytes	2023-4-25 20:23:51
AC	﹢•﹡🕉☽✝⚜Halanfus⚜✝☾⚔⚝﹡﹢• (黄子瑞)	29ms	6.7 MiB		189 Bytes	2023-9-1 21:11:57
AC	关博源	30ms	436 KiB		191 Bytes	2023-2-24 18:26:31
AC	德克萨斯做的到吗 (liyangbao)	30ms	512 KiB		249 Bytes	2022-11-6 0:01:51
AC	拥抱幸福小熊(吴沛篪)	30ms	7.1 MiB		164 Bytes	2023-11-4 10:23:52
AC	颜梓宇	30ms	8.2 MiB		164 Bytes	2023-8-25 17:04:44
AC	chaikexu	30ms	432 KiB		150 Bytes	2022-11-26 20:51:13
AC	e^(i×π)+1=0	30ms	7.1 MiB		164 Bytes	2024-1-17 21:54:53
AC	新壹街校区-周士杰 (zsj)	30ms	512 KiB		140 Bytes	2023-5-19 18:47:46
AC	XMW22024LXN	30ms	7 MiB		158 Bytes	2023-12-17 14:54:52
AC	金沙校区-蓝祥与 (蓝祥与)	30ms	512 KiB		170 Bytes	2022-12-2 22:17:29
AC	杨瀚霖 (yanghanlin)	30ms	440 KiB		187 Bytes	2022-12-30 17:03:12
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	30ms	512 KiB		181 Bytes	2023-5-10 22:15:45
AC	dengfeng	30ms	436 KiB		149 Bytes	2022-7-22 16:52:39
AC	黄立信	30ms	512 KiB		191 Bytes	2022-12-3 18:21:46
AC	黄梓轩 (huangzixuan)	30ms	384 KiB		164 Bytes	2022-9-10 16:48:01
AC	杨朔	30ms	6.9 MiB		148 Bytes	2023-11-4 10:54:36
AC	煞笔笔	30ms	6.9 MiB		143 Bytes	2023-11-30 18:29:14
AC	zzy	30ms	440 KiB		171 Bytes	2023-4-8 15:55:20
AC	秦兴润	30ms	6.7 MiB		198 Bytes	2023-9-3 8:41:51
AC	xuaonan	30ms	512 KiB		189 Bytes	2022-10-4 18:04:39
AC	李树崑 (lishukun)	30ms	512 KiB		231 Bytes	2022-11-5 12:47:13
AC	tsc_ (杨悦堃)	30ms	512 KiB		166 Bytes	2023-3-3 20:09:09
AC	dinghaoyan1	30ms	384 KiB		219 Bytes	2022-10-27 19:57:08
AC	任伊涵	30ms	7.2 MiB		178 Bytes	2023-7-9 14:36:33
AC	AC[谭赫奕] (tanheyi)	30ms	384 KiB		187 Bytes	2023-4-16 9:37:40
AC	zzl	30ms	6.8 MiB		186 Bytes	2023-11-6 21:22:09
AC	ganlin1	30ms	6.9 MiB		139 Bytes	2023-7-12 18:19:51
AC	江坤锜	30ms	512 KiB		206 Bytes	2023-3-8 19:57:48
AC	贾博涵	30ms	6.8 MiB		143 Bytes	2023-11-6 16:09:42
AC	Stephen Stevenson	30ms	384 KiB		149 Bytes	2023-1-15 17:39:47
AC	U城校区-董思羽 (董思羽)	30ms	6.7 MiB		170 Bytes	2023-9-5 23:26:34
AC	罗伟杰 (13308275065)	30ms	512 KiB		198 Bytes	2022-11-26 13:00:21
AC	新壹街校区-杨轩懿 (杨轩懿1)	30ms	6.7 MiB		170 Bytes	2023-8-28 14:46:50
AC	蒲梓勋 (puzixun)	31ms	440 KiB		202 Bytes	2022-10-20 22:19:06
AC	张梓辰 (DiaoDesi屌德斯)	31ms	512 KiB		180 Bytes	2022-9-13 21:29:15
AC	邹曜丞 (13983097018)	31ms	6.9 MiB		156 Bytes	2023-6-30 18:00:11
AC	张雯皓 (zhangwenhao)	31ms	6.8 MiB		177 Bytes	2023-6-24 9:32:51
AC	明哲瀚 (18580067605)	31ms	384 KiB		195 Bytes	2022-10-9 20:17:08
AC	杨皓宇 (杨浩宇)	31ms	440 KiB		170 Bytes	2022-8-7 18:12:41
AC	JOKER (hhy)	31ms	7 MiB		236 Bytes	2023-7-20 17:06:33
AC	明哲瀚 (18580067605)	31ms	384 KiB		195 Bytes	2022-10-9 20:17:05
AC	zcx	31ms	640 KiB		172 Bytes	2022-10-22 9:19:04
AC	你猜呀	31ms	440 KiB		181 Bytes	2023-3-12 11:08:10
AC	xflt_dyp	31ms	6.9 MiB		166 Bytes	2023-7-22 16:14:48
AC	scallway	31ms	392 KiB		151 Bytes	2023-1-14 10:54:37
AC	丛林 (conglin)	31ms	488 KiB		189 Bytes	2022-12-4 16:38:45
AC	希蒙 (zhengxingya)	31ms	6.9 MiB		253 Bytes	2023-8-14 14:48:14
AC	hxb	31ms	408 KiB		171 Bytes	2022-9-17 17:29:49
AC	葛琮扬	31ms	6.9 MiB		162 Bytes	2023-7-20 12:56:25
AC	罗竣瀚	31ms	420 KiB		152 Bytes	2022-10-29 13:20:21
AC	徐伟宸 (徐伟宸1)	31ms	7 MiB		151 Bytes	2023-12-27 21:18:42
AC	明轩 (吕同学)	31ms	7.2 MiB		177 Bytes	2024-1-23 10:58:42
AC	及级姐	31ms	6.9 MiB		175 Bytes	2023-11-4 10:50:19
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	31ms	440 KiB		156 Bytes	2022-8-31 19:00:11
AC	zzzrrrxxx	31ms	7.1 MiB		163 Bytes	2023-7-18 11:34:07
AC	pandap&a王皓宸 (WANGHAOCHEN)	31ms	512 KiB		140 Bytes	2022-12-2 21:14:47
AC	wangyueru	31ms	432 KiB		172 Bytes	2022-10-15 19:54:21
AC	时代一校林星宇 (lxy)	32ms	440 KiB		197 Bytes	2023-2-9 18:31:08
AC	时代一校-王宥量 (wangyouliang)	32ms	512 KiB		168 Bytes	2022-10-1 16:19:07
AC	向俊熙 (xiangjunxi23003)	32ms	512 KiB		166 Bytes	2023-3-22 16:13:50
AC	dinghaoyan1	32ms	392 KiB		219 Bytes	2022-10-27 19:57:11
AC	11451254188 (22029-mjh)	32ms	392 KiB		171 Bytes	2022-12-17 21:10:17
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)	32ms	512 KiB		199 Bytes	2022-10-16 16:51:18
AC	曾龙兮	32ms	6.8 MiB		180 Bytes	2023-6-12 21:44:56
AC	新壹街——陈学彬 (BUG)	32ms	7.5 MiB		153 Bytes	2023-7-10 9:47:40
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)	32ms	6.9 MiB		222 Bytes	2023-8-17 14:59:26
AC	周琪渃	32ms	512 KiB		164 Bytes	2022-12-9 21:05:56
AC	raozheng	32ms	512 KiB		231 Bytes	2023-1-18 10:32:09
AC	liusitong	32ms	6.9 MiB		196 Bytes	2023-8-10 17:28:12
AC	wzzjnb2012	32ms	440 KiB		196 Bytes	2022-9-27 20:30:20
AC	新壹街陈科言 (cky)	32ms	7 MiB		242 Bytes	2023-7-20 11:30:07