字符数组基本输入输出2(带空格)

状态	递交者	时间	内存	代码	递交时间
AC	陈骏逸 (chenjunyi)	30ms	440 KiB	120 Bytes	2022-7-24 20:31:20
AC	ttt123	30ms	444 KiB	111 Bytes	2022-12-3 22:20:28
AC	sqmyb	30ms	512 KiB	103 Bytes	2023-5-7 16:37:56
AC	wuqilin	30ms	384 KiB	119 Bytes	2022-10-1 15:41:53
AC	陈于硕(我™的) (chenyu)	30ms	384 KiB	119 Bytes	2023-3-25 10:45:15
AC	许炜铭 (xuweiming)	30ms	7.4 MiB	143 Bytes	2023-6-10 20:22:10
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	30ms	444 KiB	159 Bytes	2022-2-26 18:17:56
AC	zhoumingze23017	30ms	6.7 MiB	110 Bytes	2023-9-4 19:04:44
AC	新壹街校区-罗斤天 (罗斤天)	30ms	7 MiB	177 Bytes	2023-7-9 8:50:09
AC	lichenrui23010	30ms	6.7 MiB	104 Bytes	2023-8-27 16:39:14
AC	黄立信	30ms	512 KiB	128 Bytes	2023-5-16 21:36:23
AC	源著校区-宋昊成 (马冬梅)	30ms	436 KiB	123 Bytes	2023-2-26 19:40:47
AC	爱琴海校区-胡靖欢 (胡靖欢1)	30ms	384 KiB	119 Bytes	2023-3-25 10:56:39
AC	汪筱淞	30ms	512 KiB	145 Bytes	2022-10-29 20:58:40
AC	LUKHE (LukeHu)	30ms	512 KiB	127 Bytes	2022-2-20 13:51:48
AC	周琪渃	30ms	436 KiB	148 Bytes	2022-11-26 19:03:10
AC	陈骏逸 (chenjunyi)	30ms	7 MiB	127 Bytes	2023-7-10 11:10:33
AC	繁星 (05c35-zzm)	30ms	392 KiB	107 Bytes	2022-11-6 10:16:20
AC	我很6 (zjj22031)	30ms	392 KiB	97 Bytes	2022-12-18 10:30:17
AC	周景炀	30ms	6.9 MiB	125 Bytes	2023-6-18 14:37:56
AC	(张洛诚)	30ms	444 KiB	129 Bytes	2023-4-18 20:09:24
AC	UsMt1 (jiangyuan)	30ms	6.9 MiB	111 Bytes	2023-7-20 15:48:59
AC	伍芷函	30ms	512 KiB	128 Bytes	2023-3-8 17:02:48
AC	hyc	30ms	384 KiB	124 Bytes	2023-3-25 10:57:24
AC	RanHao	30ms	6.9 MiB	147 Bytes	2023-7-26 18:25:25
AC	zhoumingze23017	30ms	6.7 MiB	108 Bytes	2023-9-4 19:05:18
AC	繁星 (05c35-zzm)	30ms	440 KiB	107 Bytes	2022-11-6 10:16:28
AC	乐瀚阳 (yuehanyang)	30ms	428 KiB	122 Bytes	2023-4-15 16:22:50
AC	邵冠铖 (shaoguancheng22031)	30ms	384 KiB	91 Bytes	2022-12-18 10:26:13
AC	繁星 (05c35-zzm)	30ms	392 KiB	107 Bytes	2022-11-6 10:16:23
AC	wangruibo20xh	30ms	6.8 MiB	74 Bytes	2023-11-7 15:45:46
AC	黄彦熹 (AK-203)	30ms	452 KiB	144 Bytes	2023-2-26 19:50:42
AC	繁星 (05c35-zzm)	30ms	392 KiB	107 Bytes	2022-11-6 10:16:25
AC	AC[谭赫奕] (tanheyi)	30ms	512 KiB	115 Bytes	2023-4-17 10:37:46
AC	龚铭俊 (哈哈哈)	30ms	6.6 MiB	115 Bytes	2023-6-4 10:58:42
AC	纪承熙 (jcx001)	30ms	512 KiB	128 Bytes	2022-11-5 17:44:10
AC	leisixian (22029-lyh)	30ms	388 KiB	106 Bytes	2022-12-11 17:11:22
AC	时代二校-王盼兮 (wangpanxi)	30ms	7.3 MiB	115 Bytes	2023-8-25 15:32:02
AC	dinghaoyan1	30ms	512 KiB	117 Bytes	2022-11-27 15:24:57
AC	繁星 (05c35-zzm)	30ms	392 KiB	107 Bytes	2022-11-6 10:16:22
AC	新壹街.曾祥睿 (zxr)	30ms	6.8 MiB	129 Bytes	2023-10-21 13:05:22
AC	zhangzhimo	30ms	440 KiB	129 Bytes	2022-12-4 11:11:48
AC	李林峰 (金克拉)	30ms	392 KiB	110 Bytes	2022-9-14 20:37:32
AC	爱琴海校区jzn (jzn)	30ms	392 KiB	126 Bytes	2023-3-25 10:55:53
AC	yh1	31ms	512 KiB	139 Bytes	2023-3-19 15:18:17
AC	靳博然 (jbr)	31ms	436 KiB	133 Bytes	2023-5-28 17:11:15
AC	CK (李弘毅)	31ms	436 KiB	123 Bytes	2022-10-30 10:38:13
AC	易锦程 (sky)	31ms	512 KiB	118 Bytes	2023-5-13 11:29:19
AC	没有此人 (akm)	31ms	512 KiB	165 Bytes	2022-9-5 15:56:37
AC	三差学生(尘埃蓝莓) (白佳睿)	31ms	8.4 MiB	113 Bytes	2023-7-10 17:55:42
AC	胡澜之 (666hlz666)	31ms	436 KiB	127 Bytes	2023-5-9 20:32:29
AC	zyl	31ms	7.1 MiB	123 Bytes	2024-1-21 14:29:55
AC	蒲梓勋 (puzixun)	31ms	384 KiB	141 Bytes	2022-10-16 10:40:02
AC	zcx	31ms	400 KiB	93 Bytes	2022-12-11 17:09:36
AC	Error404sans (焦阳浩云)	31ms	6.9 MiB	135 Bytes	2023-6-18 14:42:39
AC	伍芷函	31ms	436 KiB	125 Bytes	2023-1-31 11:33:18
AC	lihaoyi	31ms	384 KiB	112 Bytes	2022-12-18 10:32:16
AC	昌文迪 (05c05-cwd2)	31ms	392 KiB	105 Bytes	2022-11-4 21:07:36
AC	soha (武夷岩)	31ms	512 KiB	115 Bytes	2023-3-18 14:54:18
AC	谢欣霖 (xiexinlin)	31ms	436 KiB	146 Bytes	2022-11-17 11:45:29
AC	22029-hqh	31ms	384 KiB	117 Bytes	2022-12-22 11:55:43
AC	时代校区-刘臣原 (微笑王子)	31ms	512 KiB	115 Bytes	2022-9-5 21:55:32
AC	王晨志 (wangchenzhi)	31ms	428 KiB	346 Bytes	2022-9-3 17:50:50
AC	86想要钱 (twt)	31ms	436 KiB	111 Bytes	2022-12-4 16:32:43
AC	22029-hqh	31ms	384 KiB	117 Bytes	2022-12-22 11:55:38
AC	lihaotian	31ms	512 KiB	120 Bytes	2022-8-23 20:23:50
AC	俞文博	31ms	440 KiB	141 Bytes	2022-11-5 21:12:53
AC	许炜铭 (xuweiming)	31ms	6.9 MiB	143 Bytes	2023-7-18 16:34:21
AC	22029-hqh	31ms	384 KiB	117 Bytes	2022-12-22 11:55:38
AC	zjm	31ms	512 KiB	116 Bytes	2022-12-18 10:32:02
AC	没有此人 (akm)	31ms	7.1 MiB	155 Bytes	2023-7-7 16:18:50
AC	https://www.minecraft.net/zh-hans (王振西)	31ms	6.9 MiB	114 Bytes	2023-6-18 14:30:28
AC	贺睿林	31ms	6.7 MiB	99 Bytes	2023-6-4 10:30:11
AC	无尽的想象 (谭仕高)	32ms	6.7 MiB	338 Bytes	2023-9-8 13:18:28
AC	22029-hqh	32ms	392 KiB	117 Bytes	2022-12-22 11:55:43
AC	新壹街校区-杨轩懿 (杨轩懿1)	32ms	6.9 MiB	195 Bytes	2023-7-25 12:58:38
AC	李晨希	32ms	512 KiB	120 Bytes	2023-3-25 10:44:11
AC	金沙—彭智宸 (彭智宸)	32ms	6.7 MiB	126 Bytes	2023-6-4 12:16:22
AC	邹曜丞 (13983097018)	32ms	6.9 MiB	123 Bytes	2023-7-19 13:44:09
AC	游灵一幻 (martin)	32ms	6.7 MiB	113 Bytes	2023-6-4 10:34:33
AC	22029-zjs	32ms	412 KiB	120 Bytes	2022-12-11 17:11:22
AC	朱老师 (zyp)	32ms	388 KiB	116 Bytes	2022-12-18 10:28:59
AC	liusitong	32ms	7.2 MiB	107 Bytes	2023-6-18 14:47:30
AC	22029-hqh	32ms	384 KiB	117 Bytes	2022-12-22 11:55:41
AC	杨淇瑞 (杨淇瑞29)	32ms	6.7 MiB	133 Bytes	2023-9-22 22:55:01
AC	22029-hqh	32ms	392 KiB	117 Bytes	2022-12-22 11:55:39
AC	zhangyouze (张佑泽)	32ms	7.3 MiB	161 Bytes	2023-12-16 18:38:17
AC	luozixi	32ms	512 KiB	181 Bytes	2023-2-23 19:17:51
AC	zyq1	32ms	512 KiB	110 Bytes	2023-3-27 21:05:24
AC	执剑人罗辑 (Jasson)	32ms	512 KiB	128 Bytes	2023-3-11 16:31:22
AC	22029-zjs	32ms	392 KiB	120 Bytes	2022-12-11 17:11:04
AC	何欣洋	32ms	512 KiB	315 Bytes	2023-3-25 10:49:13
AC	22029-lsl	32ms	384 KiB	167 Bytes	2022-12-11 17:10:00
AC	谭懿轩 (yanyixuan)	32ms	460 KiB	165 Bytes	2022-10-29 22:20:16
AC	yuqihao	32ms	7.2 MiB	145 Bytes	2024-1-13 10:53:50
AC	Tender. (05c05-zhou)	32ms	432 KiB	131 Bytes	2022-10-19 21:58:01
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	420 KiB	113 Bytes	2022-12-11 17:12:50
AC	许嘉恩 (xje22031)	32ms	428 KiB	117 Bytes	2022-12-18 10:28:10
AC	luosifu22006	32ms	384 KiB	112 Bytes	2022-11-3 19:36:02
AC	高国瑞	32ms	6.9 MiB	109 Bytes	2023-7-23 14:50:30