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

状态	递交者	时间	内存	代码	递交时间
AC	漆星语 (qixingyu)	30ms	7.1 MiB	144 Bytes	2023-7-3 9:27:26
AC	sqmyb	30ms	512 KiB	159 Bytes	2023-2-26 17:45:12
AC	程子杰 (05c41-czj)	30ms	444 KiB	180 Bytes	2022-7-27 11:13:13
AC	吴佳智 (AWM)	30ms	428 KiB	200 Bytes	2023-5-9 20:33:19
AC	巨珩宇	30ms	444 KiB	162 Bytes	2023-5-11 21:33:19
AC	肖添宇	30ms	424 KiB	438 Bytes	2022-4-16 20:16:14
AC	昌文迪 (05c05-cwd2)	30ms	392 KiB	158 Bytes	2022-11-4 21:08:09
AC	hyh	30ms	384 KiB	172 Bytes	2023-3-25 11:20:09
AC	CK (李弘毅)	30ms	512 KiB	218 Bytes	2022-10-30 10:38:44
AC	胡程禹	30ms	6.9 MiB	177 Bytes	2023-7-7 10:08:15
AC	hyh22031	30ms	432 KiB	147 Bytes	2022-12-18 10:35:48
AC	zhoumingze23017	30ms	6.7 MiB	177 Bytes	2023-9-4 19:16:31
AC	Tender. (05c05-zhou)	30ms	440 KiB	190 Bytes	2023-5-14 17:16:53
AC	曹埊睿 (caodirui)	30ms	440 KiB	156 Bytes	2023-4-16 10:58:57
AC	8086	30ms	7 MiB	172 Bytes	2023-7-12 10:33:18
AC	wangruibo20xh	30ms	6.8 MiB	132 Bytes	2023-11-7 15:51:42
AC	ttt123	30ms	512 KiB	187 Bytes	2022-12-3 22:22:13
AC	王彬羽 (wby)	30ms	520 KiB	211 Bytes	2023-5-10 16:31:55
AC	欧俊阳	30ms	6.7 MiB	208 Bytes	2023-8-24 15:27:26
AC	坤坤荔枝小黑子 (zhonghaotian22006)	30ms	7 MiB	179 Bytes	2023-12-19 19:26:44
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	30ms	512 KiB	210 Bytes	2022-2-26 18:18:45
AC	zry	30ms	512 KiB	162 Bytes	2022-11-6 9:54:14
AC	王晨志 (wangchenzhi)	30ms	440 KiB	404 Bytes	2022-9-3 17:51:50
AC	灵光sans (wangchihao)	30ms	392 KiB	169 Bytes	2023-4-15 17:15:24
AC	soha (武夷岩)	30ms	432 KiB	195 Bytes	2023-3-18 14:53:44
AC	Tender. (05c05-zhou)	30ms	512 KiB	190 Bytes	2022-10-19 21:58:48
AC	蒲梓勋 (puzixun)	30ms	384 KiB	168 Bytes	2022-10-18 21:15:36
AC	iLansensei (hjs(Caster))	30ms	384 KiB	166 Bytes	2022-11-6 10:02:35
AC	中二游侠(๑•̀ㅂ•́)و✧ (张凯翔)	30ms	512 KiB	215 Bytes	2022-9-10 11:00:56
AC	Error404sans (焦阳浩云)	30ms	6.9 MiB	187 Bytes	2023-6-18 14:43:20
AC	hyc	30ms	384 KiB	191 Bytes	2023-3-25 11:18:49
AC	小根哥	30ms	444 KiB	181 Bytes	2022-8-24 15:30:19
AC	22029-hqh	30ms	384 KiB	168 Bytes	2022-12-22 12:22:19
AC	马兴宇 (mxy01)	30ms	512 KiB	174 Bytes	2022-10-1 19:16:32
AC	陈佳婧	30ms	512 KiB	212 Bytes	2022-9-9 20:51:49
AC	zhangzhixiong	30ms	6.9 MiB	179 Bytes	2023-6-18 14:36:31
AC	许炜铭 (xuweiming)	30ms	6.9 MiB	185 Bytes	2023-7-18 16:34:51
AC	wuqilin	31ms	436 KiB	184 Bytes	2022-12-3 17:00:33
AC	22029-hqh	31ms	384 KiB	168 Bytes	2022-12-22 12:22:31
AC	时代一校-曾科智 (曾科智)	31ms	448 KiB	214 Bytes	2022-9-10 20:35:45
AC	陈于硕(我™的) (chenyu)	31ms	392 KiB	181 Bytes	2023-3-25 10:50:21
AC	Z.饮月君 (张皓南)	31ms	512 KiB	194 Bytes	2022-8-25 21:48:31
AC	谢雨贝	31ms	440 KiB	183 Bytes	2023-5-3 20:50:21
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	31ms	512 KiB	168 Bytes	2022-9-24 21:35:23
AC	zyq1	31ms	512 KiB	175 Bytes	2023-3-27 21:14:35
AC	黄誉翔 (黄誉翔)	31ms	512 KiB	167 Bytes	2022-12-3 20:01:31
AC	游灵一幻 (martin)	31ms	6.7 MiB	157 Bytes	2023-6-4 10:38:24
AC	xuniaoyin (徐袅音)	31ms	6.9 MiB	167 Bytes	2023-7-28 10:59:26
AC	https://www.minecraft.net/zh-hans (王振西)	31ms	6.9 MiB	167 Bytes	2023-6-18 14:43:58
AC	22029-hqh	31ms	392 KiB	168 Bytes	2022-12-22 12:22:24
AC	陈雨泽1	31ms	436 KiB	286 Bytes	2022-10-1 15:35:22
AC	22029-lyh	31ms	384 KiB	197 Bytes	2022-12-11 17:34:20
AC	lichenrui23010	31ms	6.7 MiB	158 Bytes	2023-8-27 16:51:48
AC	小忙果 (王昱杰)	31ms	6.9 MiB	165 Bytes	2023-7-18 9:06:34
AC	我很6 (zjj22031)	31ms	432 KiB	132 Bytes	2022-12-18 10:35:05
AC	wanghuaiying	31ms	7.2 MiB	186 Bytes	2024-1-13 11:00:11
AC	RanHao	31ms	6.9 MiB	189 Bytes	2023-7-26 18:26:19
AC	22029-hqh	31ms	392 KiB	168 Bytes	2022-12-22 12:22:25
AC	miku (阳沐珊)	31ms	392 KiB	231 Bytes	2022-6-4 9:13:58
AC	wyc	31ms	7 MiB	194 Bytes	2023-11-25 17:11:16
AC	22029-lsl	31ms	428 KiB	170 Bytes	2022-12-11 17:33:33
AC	の (魏子恒)	31ms	512 KiB	213 Bytes	2022-9-13 18:39:03
AC	22029-hqh	31ms	392 KiB	168 Bytes	2022-12-22 12:22:19
AC	yuqihao	31ms	7.2 MiB	197 Bytes	2024-1-13 11:02:35
AC	lihaoyi	31ms	392 KiB	147 Bytes	2022-12-18 10:34:31
AC	你猜呀	31ms	512 KiB	148 Bytes	2023-3-23 20:37:52
AC	新壹街.曾祥睿 (zxr)	31ms	6.8 MiB	170 Bytes	2023-10-21 13:05:49
AC	(金沙天街)严皓月 (严皓月)	31ms	512 KiB	199 Bytes	2023-5-7 10:48:20
AC	22029-hqh	31ms	412 KiB	168 Bytes	2022-12-22 12:22:18
AC	时代二校-王盼兮 (wangpanxi)	31ms	8 MiB	181 Bytes	2023-8-25 15:44:23
AC	纪承熙 (jcx001)	31ms	512 KiB	218 Bytes	2022-11-16 16:23:31
AC	kql1	31ms	7 MiB	177 Bytes	2023-11-25 17:11:45
AC	邵冠铖 (shaoguancheng22031)	31ms	392 KiB	126 Bytes	2022-12-18 10:35:25
AC	缥 (王硕2012)	32ms	384 KiB	169 Bytes	2022-12-18 10:24:27
AC	高国瑞	32ms	6.9 MiB	148 Bytes	2023-7-23 14:58:05
AC	22029-hqh	32ms	388 KiB	168 Bytes	2022-12-22 12:22:25
AC	时代一校蒋帛希 (13983392730)	32ms	392 KiB	155 Bytes	2023-1-14 17:34:00
AC	林凡童 (lft)	32ms	444 KiB	280 Bytes	2022-9-15 19:44:06
AC	伍芷函	32ms	436 KiB	191 Bytes	2023-3-8 17:00:11
AC	时代一校 - 冯隆浩 (冯隆浩)	32ms	7.1 MiB	179 Bytes	2023-7-14 10:33:10
AC	wangzihang	32ms	7.1 MiB	256 Bytes	2023-11-25 16:24:05
AC	22029-hqh	32ms	392 KiB	168 Bytes	2022-12-22 12:22:24
AC	xyc (谢雨宸)	32ms	436 KiB	164 Bytes	2023-5-28 9:19:56
AC	lihaotian	32ms	432 KiB	216 Bytes	2022-8-23 20:26:08
AC	22029-hqh	32ms	404 KiB	168 Bytes	2022-12-22 12:22:32
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	384 KiB	188 Bytes	2022-12-11 17:31:04
AC	徐正旺 (xzw)	32ms	7.1 MiB	181 Bytes	2023-7-14 10:29:41
AC	朱泽晟	32ms	384 KiB	263 Bytes	2022-8-30 13:11:28
AC	三差学生(尘埃蓝莓) (白佳睿)	32ms	8.4 MiB	156 Bytes	2023-7-10 17:56:19
AC	新壹街朱启航 (zhuqihang)	32ms	7.1 MiB	201 Bytes	2024-1-22 21:29:57
AC	zcx	32ms	440 KiB	167 Bytes	2022-12-11 17:37:33
AC	22029-zjs	32ms	384 KiB	209 Bytes	2022-12-11 17:33:45
AC	黄诗童 (hst01)	32ms	512 KiB	213 Bytes	2022-11-4 19:24:26
AC	司雨来 (siyulai)	32ms	384 KiB	171 Bytes	2023-1-14 20:53:13
AC	金沙—彭智宸 (彭智宸)	32ms	6.9 MiB	147 Bytes	2023-8-8 20:05:17
AC	王瀚毅 (wanghanyi)	32ms	512 KiB	165 Bytes	2023-1-15 11:39:18
AC	贺睿林	32ms	6.7 MiB	142 Bytes	2023-6-4 10:36:59
AC	86想要钱 (twt)	32ms	512 KiB	185 Bytes	2022-12-4 16:39:57
AC	11451254188 (22029-mjh)	32ms	420 KiB	166 Bytes	2022-12-11 17:33:11
AC	汤杰尧 (05c05-tjy1)	32ms	384 KiB	174 Bytes	2023-4-24 20:21:33