简单的结构体输入输出

状态	递交者	时间	内存	语言	代码	递交时间
AC	曾御城（现用名） (Jason)	4ms	420 KiB		297 Bytes	2022-1-24 16:14:13
AC	yu (赵子瑜)	4ms	384 KiB		389 Bytes	2022-4-17 16:50:48
AC	毕浩宇 (bihaoyu)	4ms	6.7 MiB		260 Bytes	2023-9-23 16:47:23
AC	11451254188 (22029-mjh)	4ms	384 KiB		244 Bytes	2023-4-15 10:04:07
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)	4ms	6.7 MiB		240 Bytes	2023-8-24 14:52:58
AC	Randy Marsh (杨子腾)	4ms	384 KiB		317 Bytes	2022-4-10 10:03:11
AC	林凡童 (lft)	4ms	440 KiB		332 Bytes	2022-9-15 20:14:55
AC	游智棋	4ms	6.9 MiB		252 Bytes	2023-7-18 19:14:59
AC	ttt123	4ms	512 KiB		325 Bytes	2023-4-15 10:00:02
AC	牟淳雅	4ms	6.7 MiB		298 Bytes	2023-9-17 10:23:33
AC	ttt123	4ms	432 KiB		307 Bytes	2022-7-1 11:31:45
AC	时代二校-焦雨齐 (Angel)	4ms	7 MiB		309 Bytes	2023-7-18 14:31:10
AC	秦子越 (13883322087)	4ms	384 KiB		489 Bytes	2022-9-27 22:20:01
AC	MacrozClick_ (蒋淞霖)	4ms	384 KiB		298 Bytes	2022-4-10 10:11:38
AC	时代2校-程俊燃 (chengjunran)	4ms	6.7 MiB		288 Bytes	2023-9-23 16:46:38
AC	欧俊阳	4ms	6.9 MiB		275 Bytes	2023-7-28 11:48:57
AC	赵一嵘 (zhaoyirong)	4ms	384 KiB		197 Bytes	2022-9-26 22:42:37
AC	你爹 (郭铠嘉)	4ms	392 KiB		243 Bytes	2022-4-10 10:08:47
AC	(张洛诚)	4ms	432 KiB		301 Bytes	2023-2-21 19:08:27
AC	kkksc03 (彭士锋)	4ms	512 KiB		295 Bytes	2022-3-12 13:37:58
AC	赵一嵘 (zhaoyirong)	4ms	384 KiB		197 Bytes	2022-9-26 22:42:30
AC	新壹街校区-陈琬舒 (空空大师)	4ms	6.7 MiB		290 Bytes	2023-9-10 15:56:47
AC	胡澜之 (666hlz666)	4ms	6.8 MiB		318 Bytes	2023-10-26 17:03:02
AC	时代2校+涂彦迪 (tuyandi)	4ms	6.7 MiB		275 Bytes	2023-9-23 16:48:13
AC	文硕 (文硕1)	4ms	440 KiB		296 Bytes	2022-2-6 14:12:28
AC	蒲梓勋 (puzixun)	4ms	432 KiB		268 Bytes	2022-8-12 17:38:42
AC	赵泳鑫 (zhaoyongxin)	4ms	436 KiB		397 Bytes	2022-3-13 9:47:47
AC	傅博涛	4ms	384 KiB		277 Bytes	2022-4-10 9:54:22
AC	弹射起飞 ? 冲 ! (吴周周)	4ms	6.7 MiB		288 Bytes	2023-9-23 16:45:35
AC	樊竣熠 (lft1114)	4ms	440 KiB		277 Bytes	2022-8-1 13:36:24
AC	22029-zjs	4ms	384 KiB		297 Bytes	2023-4-15 10:01:21
AC	中岛敦 (黄麒瑞)	4ms	6.7 MiB		313 Bytes	2023-9-29 10:03:04
AC	22029-lsl	4ms	384 KiB		225 Bytes	2023-4-15 9:59:00
AC	renqiumo	4ms	776 KiB		517 Bytes	2022-5-29 15:07:32
AC	马渝杭 (mayuhang)	4ms	512 KiB		263 Bytes	2022-10-19 19:08:17
AC	周琪渃	4ms	384 KiB		334 Bytes	2023-4-15 17:23:21
AC	谢欣霖 (xiexinlin)	4ms	436 KiB		330 Bytes	2022-3-20 10:11:49
AC	新壹街陈科言 (cky)	4ms	6.6 MiB		294 Bytes	2023-9-2 16:58:46
AC	李山水	4ms	432 KiB		419 Bytes	2022-2-20 9:34:10
AC	cheers 戴 (daizhuorun)	4ms	436 KiB		353 Bytes	2022-2-13 10:49:28
AC	zzy	4ms	444 KiB		355 Bytes	2023-4-8 16:17:46
AC	我推的乱破 (贺俊楠)	4ms	6.5 MiB		277 Bytes	2023-9-17 9:10:43
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	4ms	7 MiB	C++98	247 Bytes	2024-5-12 20:23:57
AC	时代二校+王吕棪 (wanglvyan)	4ms	6.7 MiB		255 Bytes	2023-9-23 16:47:49
AC	zhangyouze (张佑泽)	4ms	6.8 MiB		327 Bytes	2023-9-2 17:05:02
AC	王晴萱	4ms	7 MiB		348 Bytes	2023-7-20 11:26:52
AC	yu (赵子瑜)	4ms	384 KiB		389 Bytes	2022-4-17 16:50:48
AC	爱琴海校区jzn (jzn)	4ms	7.5 MiB		261 Bytes	2023-7-3 17:54:13
AC	赵一嵘 (zhaoyirong)	4ms	412 KiB		197 Bytes	2022-9-26 22:42:41
AC	李哲 (lizhe)	4ms	432 KiB		263 Bytes	2022-10-29 13:13:42
AC	张景豪	4ms	436 KiB		246 Bytes	2023-5-31 19:07:51
AC	Tender. (05c05-zhou)	4ms	408 KiB		300 Bytes	2022-10-19 22:00:30
AC	缥 (王硕2012)	4ms	476 KiB		338 Bytes	2023-4-15 10:01:27
AC	可爱的小花狗	4ms	6.7 MiB		269 Bytes	2023-9-23 16:50:43
AC	明轩 (吕同学)	5ms	512 KiB		423 Bytes	2023-1-8 18:27:07
AC	xuniaoyin (徐袅音)	5ms	6.8 MiB		298 Bytes	2023-7-28 12:21:26
AC	邹曜丞 (13983097018)	5ms	7 MiB		346 Bytes	2023-7-18 14:34:35
AC	赵一嵘 (zhaoyirong)	5ms	384 KiB		197 Bytes	2022-9-26 22:44:18
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)	5ms	512 KiB		258 Bytes	2023-4-15 9:52:56
AC	黄梓轩 (huangzixuan)	5ms	6.7 MiB		213 Bytes	2023-9-17 13:31:59
AC	赵一嵘 (zhaoyirong)	5ms	384 KiB		197 Bytes	2022-9-26 22:42:41
AC	zlx (xiao)	5ms	444 KiB		349 Bytes	2022-11-26 19:20:07
AC	叶雨昊 (yeyuhao22006)	5ms	432 KiB		240 Bytes	2022-10-24 19:56:55
AC	新壹街陈科言 (cky)	5ms	7 MiB		296 Bytes	2023-7-19 16:26:30
AC	RanHao	5ms	6.9 MiB		385 Bytes	2023-8-2 15:01:30
AC	刘政君 (lzj)	5ms	436 KiB		272 Bytes	2022-11-28 15:55:14
AC	新壹街朱启航 (zhuqihang)	5ms	6.8 MiB		305 Bytes	2023-9-2 17:04:21
AC	SYC0226	5ms	508 KiB		301 Bytes	2022-10-3 10:47:54
AC	guozuming	5ms	432 KiB		228 Bytes	2022-12-31 19:06:35
AC	没有此人 (akm)	5ms	6.9 MiB		316 Bytes	2023-7-2 19:28:05
AC	小忙果 (王昱杰)	5ms	6.7 MiB		297 Bytes	2023-9-2 16:57:24
AC	希蒙 (zhengxingya)	5ms	7 MiB		293 Bytes	2023-7-21 8:34:18
AC	xuniaoyin (徐袅音)	5ms	6.9 MiB		298 Bytes	2023-7-29 10:56:25
AC	miku (阳沐珊)	5ms	6.9 MiB		297 Bytes	2023-7-20 13:41:39
AC	司雨来 (siyulai)	5ms	440 KiB		286 Bytes	2023-1-8 18:25:39
AC	杨浩灵 (金坷拉)	5ms	6.9 MiB		860 Bytes	2023-7-18 16:37:22
AC	黄梓桐 (HuangZiTong)	5ms	444 KiB		210 Bytes	2023-3-19 14:13:34
AC	xuniaoyin (徐袅音)	5ms	6.9 MiB		298 Bytes	2023-7-29 10:56:35
AC	霍弈丞小号	5ms	440 KiB		296 Bytes	2023-4-16 17:11:03
AC	龚信丞	5ms	420 KiB		280 Bytes	2023-5-28 18:04:41
AC	王义苇 (wangyiwei)	6ms	6.7 MiB		251 Bytes	2023-6-11 14:36:07
AC	chaikexu	6ms	512 KiB		309 Bytes	2023-2-26 11:17:28
AC	张雯皓 (zhangwenhao)	7ms	7 MiB		264 Bytes	2023-12-23 11:33:01
AC	罗翌珂 (dangdang)	7ms	432 KiB		318 Bytes	2022-9-3 10:40:04
AC	坤坤荔枝小黑子 (zhonghaotian22006)	7ms	384 KiB		333 Bytes	2022-11-3 21:12:20
AC	新壹街—熊轩杭 (xiongxuanhang)	8ms	7.2 MiB		351 Bytes	2023-11-30 19:21:10
AC	黄立信	10ms	4.1 MiB		324 Bytes	2023-1-14 10:19:54
AC	AAA? Prow max (hechenxuan23005)	15ms	8.1 MiB	C++98	283 Bytes	2024-6-15 16:21:34
AC	嘿嘿	17ms	532 KiB		304 Bytes	2024-3-31 17:12:13
AC	¿¿¿??? (李睿瞳)	18ms	532 KiB		306 Bytes	2024-2-1 14:30:48
AC	（^-^) (蒋金卓)	20ms	532 KiB		271 Bytes	2024-1-29 16:41:35
AC	cainuoyan	21ms	532 KiB	C++98	244 Bytes	2024-10-17 20:33:54
AC	蔡蕊池	21ms	532 KiB		291 Bytes	2024-3-2 13:24:34
AC	ReFly (NKZKY)	22ms	532 KiB		326 Bytes	2024-2-1 17:01:58
AC	煞笔笔	22ms	532 KiB		203 Bytes	2024-4-4 11:06:45
AC	311	22ms	532 KiB	C++14(O2)	258 Bytes	2024-10-19 18:42:23
AC	My name is Man (钟卓劭)	22ms	768 KiB		170 Bytes	2024-3-31 9:43:01
AC	嘿嘿	22ms	536 KiB		193 Bytes	2024-3-31 17:09:55
AC	吴攸 (wuyou)	23ms	532 KiB		261 Bytes	2024-2-2 17:59:42
AC	郑世檄	23ms	768 KiB	C++11(O2)	272 Bytes	2024-11-16 19:09:46