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

状态	递交者	时间	内存	代码	递交时间
AC	陈于硕(我™的) (chenyu)	29ms	384 KiB	111 Bytes	2023-3-25 10:44:11
AC	熊奕博 (Mothefuck)	29ms	512 KiB	147 Bytes	2023-2-26 18:29:20
AC	乐瀚阳 (yuehanyang)	29ms	392 KiB	115 Bytes	2023-4-15 16:20:27
AC	陈佳婧	29ms	436 KiB	134 Bytes	2022-9-9 20:48:40
AC	灵光sans (wangchihao)	29ms	392 KiB	102 Bytes	2023-4-15 17:11:46
AC	wangruibo20xh	29ms	6.8 MiB	66 Bytes	2023-11-7 15:43:12
AC	中岛敦 (黄麒瑞)	29ms	6.8 MiB	109 Bytes	2023-10-3 11:28:58
AC	新壹街校区-杨轩懿 (杨轩懿1)	29ms	6.9 MiB	195 Bytes	2023-7-25 12:58:12
AC	lihaotian	30ms	512 KiB	102 Bytes	2022-8-23 20:14:12
AC	dustsans (njo)	30ms	512 KiB	95 Bytes	2022-11-25 20:38:22
AC	黄梓轩 (huangzixuan)	30ms	512 KiB	159 Bytes	2022-11-28 17:37:45
AC	U城校区-郭旻哲 (郭旻哲)	30ms	6.7 MiB	111 Bytes	2023-9-3 22:03:15
AC	伍芷函	30ms	436 KiB	115 Bytes	2023-1-31 11:32:58
AC	何昊宇 (22016-hhy)	30ms	512 KiB	114 Bytes	2022-9-11 9:20:34
AC	胡澜之 (666hlz666)	30ms	424 KiB	111 Bytes	2023-4-29 21:12:28
AC	霍弈丞小号	30ms	384 KiB	156 Bytes	2023-2-26 16:19:27
AC	新壹街陈科言 (cky)	30ms	512 KiB	108 Bytes	2023-5-12 20:01:11
AC	zhangzhixiong	30ms	6.9 MiB	133 Bytes	2023-6-18 14:34:48
AC	sqmyb	30ms	436 KiB	95 Bytes	2023-2-26 17:39:45
AC	hyc	30ms	396 KiB	133 Bytes	2023-3-25 10:52:46
AC	新壹街.曾祥睿 (zxr)	30ms	6.8 MiB	117 Bytes	2023-10-21 13:04:47
AC	钟元朗	30ms	436 KiB	90 Bytes	2022-11-5 16:49:13
AC	小根哥	30ms	512 KiB	96 Bytes	2022-8-22 15:02:45
AC	zyq1	30ms	512 KiB	126 Bytes	2023-3-27 21:01:52
AC	hyh	30ms	384 KiB	111 Bytes	2023-3-25 10:49:15
AC	qinlang	30ms	6.8 MiB	110 Bytes	2023-10-19 19:20:10
AC	朱泽晟	30ms	512 KiB	164 Bytes	2022-8-29 17:06:51
AC	liusitong	30ms	6.9 MiB	110 Bytes	2023-6-18 14:37:40
AC	RanHao	30ms	6.9 MiB	139 Bytes	2023-7-26 18:25:02
AC	新壹街校区--税崇峻 (税崇峻)	30ms	6.9 MiB	113 Bytes	2023-8-8 15:21:53
AC	朱老师 (zyp)	30ms	6.7 MiB	126 Bytes	2023-9-4 18:58:25
AC	伍芷函	30ms	440 KiB	156 Bytes	2023-2-26 16:17:48
AC	林昱霏	30ms	512 KiB	104 Bytes	2022-12-3 20:04:24
AC	AC[谭赫奕] (tanheyi)	30ms	512 KiB	111 Bytes	2023-4-17 10:38:27
AC	南坪校区-邵冠铖 (邵冠铖)	30ms	412 KiB	97 Bytes	2023-5-27 16:52:33
AC	明哲瀚 (18580067605)	30ms	440 KiB	109 Bytes	2023-2-15 21:38:58
AC	黄梓桐 (HuangZiTong)	30ms	436 KiB	113 Bytes	2022-8-22 14:46:42
AC	时代二校-王盼兮 (wangpanxi)	30ms	6.8 MiB	111 Bytes	2023-10-22 10:58:17
AC	hyc	30ms	384 KiB	133 Bytes	2023-3-25 10:52:37
AC	田开蕊	30ms	7.1 MiB	121 Bytes	2024-1-13 10:53:02
AC	lihaoyi	30ms	384 KiB	112 Bytes	2022-12-18 10:30:02
AC	彭崇鑫	30ms	384 KiB	128 Bytes	2023-4-15 16:30:08
AC	周琪渃	30ms	520 KiB	148 Bytes	2022-11-26 17:26:11
AC	luosifu22006	30ms	384 KiB	112 Bytes	2022-11-3 19:35:23
AC	时代一校-赵彦博 (zyb)	30ms	440 KiB	103 Bytes	2022-11-29 16:08:22
AC	jinitaimei	30ms	512 KiB	92 Bytes	2022-12-4 16:29:25
AC	jinitaimei	30ms	512 KiB	92 Bytes	2023-3-16 19:45:21
AC	sb (吴振宇)	30ms	512 KiB	116 Bytes	2023-4-30 13:33:50
AC	22029-hqh	30ms	384 KiB	117 Bytes	2022-12-22 11:55:10
AC	zcx	30ms	392 KiB	93 Bytes	2022-12-11 17:08:58
AC	梅子楠 (22016-mzn)	30ms	404 KiB	94 Bytes	2022-12-4 9:18:34
AC	https://www.minecraft.net/zh-hans (王振西)	30ms	7 MiB	120 Bytes	2023-6-18 14:25:56
AC	soha (武夷岩)	30ms	440 KiB	108 Bytes	2023-3-11 15:21:06
AC	11451254188 (22029-mjh)	31ms	392 KiB	121 Bytes	2022-12-11 17:07:46
AC	22029-hqh	31ms	392 KiB	117 Bytes	2022-12-22 11:55:12
AC	黄诗童 (hst01)	31ms	512 KiB	116 Bytes	2022-10-1 19:41:13
AC	科比.布莱恩特 (董浩琰)	31ms	6.9 MiB	108 Bytes	2023-8-3 11:03:49
AC	爱情海校区—沙天一 (沙天一)	31ms	436 KiB	129 Bytes	2023-3-29 20:31:21
AC	wzzjnb2012	31ms	436 KiB	133 Bytes	2022-10-6 9:05:46
AC	colin1112 (墙凌可)	31ms	512 KiB	104 Bytes	2023-4-18 18:58:51
AC	时代2校-程俊燃 (chengjunran)	31ms	6.7 MiB	135 Bytes	2023-8-27 11:03:35
AC	hyh22031	31ms	384 KiB	108 Bytes	2022-12-18 10:28:01
AC	王晴萱	31ms	7 MiB	113 Bytes	2023-7-16 9:55:55
AC	hxb	31ms	432 KiB	106 Bytes	2023-3-24 16:41:29
AC	22029-lsl	31ms	384 KiB	125 Bytes	2022-12-11 17:07:41
AC	Tender. (05c05-zhou)	31ms	432 KiB	106 Bytes	2022-10-19 21:57:49
AC	无尽的想象 (谭仕高)	31ms	512 KiB	105 Bytes	2022-8-24 16:53:24
AC	22029-hqh	31ms	392 KiB	117 Bytes	2022-12-22 11:55:12
AC	黄誉翔 (黄誉翔)	31ms	512 KiB	101 Bytes	2022-12-3 19:27:49
AC	8086	31ms	6.9 MiB	118 Bytes	2023-7-12 10:17:28
AC	时代一校林星宇 (lxy)	31ms	440 KiB	101 Bytes	2022-10-29 20:55:04
AC	ttt123	31ms	512 KiB	114 Bytes	2022-12-3 22:19:43
AC	马渝杭 (mayuhang)	31ms	512 KiB	106 Bytes	2022-10-9 20:55:30
AC	22029-hqh	31ms	392 KiB	117 Bytes	2022-12-22 11:54:16
AC	新壹街朱启航 (zhuqihang)	31ms	7.1 MiB	145 Bytes	2024-1-22 21:29:27
AC	执剑人罗辑 (Jasson)	31ms	436 KiB	113 Bytes	2023-3-9 19:46:04
AC	曲奇饼干	31ms	512 KiB	112 Bytes	2023-5-28 9:18:17
AC	你干嘛 (唐世睿)	31ms	7 MiB	114 Bytes	2024-1-13 10:48:23
AC	邹曜丞 (13983097018)	31ms	6.9 MiB	111 Bytes	2023-7-19 13:40:41
AC	金海童1	31ms	7.1 MiB	102 Bytes	2023-12-31 14:25:49
AC	yh1	31ms	512 KiB	139 Bytes	2023-3-19 15:17:32
AC	缥 (王硕2012)	31ms	444 KiB	112 Bytes	2022-11-27 12:12:54
AC	甄一阳 (22016-zyy)	31ms	432 KiB	108 Bytes	2022-11-24 16:52:16
AC	张雯皓 (zhangwenhao)	31ms	7.1 MiB	129 Bytes	2023-12-23 11:30:43
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)	31ms	392 KiB	113 Bytes	2022-12-11 17:11:12
AC	22029-zjs	31ms	408 KiB	115 Bytes	2022-12-11 17:09:00
AC	汤杰尧 (05c05-tjy1)	31ms	512 KiB	126 Bytes	2022-11-4 22:22:42
AC	朱老师 (zyp)	31ms	384 KiB	117 Bytes	2022-12-18 10:28:16
AC	高国瑞	31ms	6.9 MiB	101 Bytes	2023-7-23 14:45:10
AC	时代校区-刘臣原 (微笑王子)	31ms	512 KiB	115 Bytes	2022-9-5 21:55:19
AC	我很6 (zjj22031)	31ms	408 KiB	97 Bytes	2022-12-18 10:24:41
AC	诸禹吉 (zhuyuji)	32ms	548 KiB	117 Bytes	2023-5-27 15:57:13
AC	pandap&a王皓宸 (WANGHAOCHEN)	32ms	436 KiB	217 Bytes	2023-4-7 19:29:55
AC	中二游侠(๑•̀ㅂ•́)و✧ (张凯翔)	32ms	444 KiB	113 Bytes	2022-9-10 11:00:01
AC	无尽的想象 (谭仕高)	32ms	6.7 MiB	208 Bytes	2023-9-8 13:11:27
AC	zjm	32ms	384 KiB	117 Bytes	2022-12-18 10:30:35
AC	huenjun	32ms	6.9 MiB	111 Bytes	2023-10-29 18:49:31
AC	小柒冉欧	32ms	7 MiB	142 Bytes	2023-11-25 17:12:53
AC	胡程禹	32ms	7 MiB	114 Bytes	2023-7-7 9:50:57
AC	无尽的想象 (谭仕高)	32ms	6.7 MiB	252 Bytes	2023-9-8 13:13:26