「例题1-4」鸡兔同笼

状态	递交者	时间	内存	语言	代码	递交时间
AC	小翔的粉丝	-	7 MiB		202 Bytes	2023-12-27 21:29:56
AC	陌生人 (涂玉龙)	2ms	7.3 MiB		278 Bytes	2024-1-21 14:01:28
AC	李哲 (lizhe)	3ms	256 KiB		210 Bytes	2022-7-29 20:04:45
AC	wangzihang	3ms	256 KiB	C++	269 Bytes	2022-7-29 14:53:49
AC	_PXY_	3ms	256 KiB		234 Bytes	2022-1-25 14:05:42
AC	姚宏逸	3ms	264 KiB	C	192 Bytes	2022-2-9 17:18:50
AC	樊竣熠 (lft1114)	3ms	256 KiB		228 Bytes	2022-4-6 18:08:51
AC	chen (peter)	3ms	256 KiB		492 Bytes	2023-2-18 3:18:54
AC	吴俊成 (wujuncheng)	3ms	256 KiB		192 Bytes	2022-7-8 23:17:45
AC	SMIK	3ms	264 KiB		234 Bytes	2022-1-24 12:35:03
AC	qwerty	3ms	256 KiB	C	227 Bytes	2022-2-14 22:12:55
AC	wangruibo20xh	3ms	256 KiB		269 Bytes	2022-1-22 11:19:18
AC	德克萨斯做的到吗 (liyangbao)	3ms	256 KiB		267 Bytes	2022-11-6 22:09:57
AC	LUKHE (LukeHu)	3ms	256 KiB		271 Bytes	2022-1-23 19:43:29
AC	杜俊宏	3ms	260 KiB		606 Bytes	2022-4-17 18:40:30
AC	1396013295	3ms	316 KiB		254 Bytes	2022-1-21 21:00:47
AC	赵沛喆	3ms	316 KiB		223 Bytes	2022-5-1 10:23:32
AC	Z.饮月君 (张皓南)	3ms	264 KiB		254 Bytes	2022-5-19 18:11:00
AC	时代一校-曾科智 (曾科智)	3ms	320 KiB		234 Bytes	2023-2-25 19:24:58
AC	赵泳鑫 (zhaoyongxin)	4ms	384 KiB		211 Bytes	2022-4-23 17:45:36
AC	疯神芭芭脱丝 (李卓修)	4ms	316 KiB		195 Bytes	2022-7-12 11:14:34
AC	胡宸华 (huchenhua)	4ms	308 KiB		249 Bytes	2022-10-16 13:28:47
AC	zyl	5ms	7.3 MiB		370 Bytes	2024-1-3 16:50:16
AC	王晨志 (wangchenzhi)	6ms	384 KiB		301 Bytes	2022-5-28 18:56:35
AC	李山水	6ms	384 KiB		384 Bytes	2022-5-22 8:46:55
AC	李彭宋代诗人 (ljy123456)	6ms	384 KiB		204 Bytes	2023-4-3 21:21:55
AC	xiangsiyu	6ms	384 KiB		210 Bytes	2022-6-21 21:12:20
AC	maomao	6ms	384 KiB		229 Bytes	2022-5-22 22:29:51
AC	雷文博（帅哥） (18983951391)	6ms	512 KiB		284 Bytes	2023-4-3 20:41:51
AC	李山水	6ms	436 KiB		384 Bytes	2022-5-22 8:46:25
AC	灿灿 (CAN)	6ms	384 KiB		230 Bytes	2022-6-17 16:18:21
AC	zlx (xiao)	6ms	384 KiB		207 Bytes	2022-5-24 21:48:05
AC	NJL (NJlL)	6ms	384 KiB		276 Bytes	2022-4-17 16:34:20
AC	huangpucwx	6ms	7.1 MiB	C++11	239 Bytes	2024-5-19 14:41:11
AC	ywh	6ms	384 KiB		295 Bytes	2022-3-26 11:09:00
AC	况奕辛 (KYX_yyds)	6ms	384 KiB		301 Bytes	2022-1-2 19:25:50
AC	刘政君 (lzj)	6ms	392 KiB		258 Bytes	2022-8-31 14:55:58
AC	zzt	6ms	384 KiB		246 Bytes	2022-3-26 22:47:13
AC	zvt_132 (任子轩)	6ms	6.5 MiB	C++98	313 Bytes	2024-7-26 11:20:07
AC	傅博涛	6ms	384 KiB		272 Bytes	2022-5-8 12:19:38
AC	hyh	6ms	7.2 MiB	C++98	249 Bytes	2024-5-4 9:21:13
AC	old_doctor	6ms	384 KiB		226 Bytes	2022-6-20 13:08:48
AC	11111	6ms	384 KiB		269 Bytes	2022-3-3 20:40:29
AC	雷文博（帅哥） (18983951391)	6ms	384 KiB		284 Bytes	2023-4-3 20:42:13
AC	雷文博（帅哥） (18983951391)	6ms	512 KiB		284 Bytes	2023-4-3 20:41:51
AC	曹埊睿 (caodirui)	6ms	440 KiB		203 Bytes	2023-4-30 22:43:52
AC	经常消失 (小萝卜)	6ms	384 KiB		285 Bytes	2022-4-3 13:31:40
AC	CK (李弘毅)	6ms	7.2 MiB	C++14(O2)	301 Bytes	2024-5-4 13:20:43
AC	CK (李弘毅)	6ms	7.2 MiB	C++20(O2)	301 Bytes	2024-5-4 13:21:01
AC	dengfeng	6ms	384 KiB		332 Bytes	2022-2-17 15:59:15
AC	MoonLight ( aaa)	6ms	420 KiB		369 Bytes	2022-1-1 10:03:36
AC	文硕 (文硕1)	6ms	512 KiB		270 Bytes	2022-2-6 13:35:10
AC	任瑞的学生 (jiangyadong)	6ms	384 KiB		294 Bytes	2022-6-14 16:37:30
AC	lvlu	6ms	392 KiB		195 Bytes	2022-7-29 14:07:13
AC	zhangyh (张育菡)	6ms	384 KiB		191 Bytes	2022-6-11 9:33:13
AC	Accepted (周芷乐)	6ms	7 MiB	C++14	205 Bytes	2024-6-17 21:15:50
AC	luoluonuoya	6ms	384 KiB		278 Bytes	2022-1-24 17:58:44
AC	詹宇航 (zyh7)	6ms	384 KiB		189 Bytes	2022-6-13 17:44:02
AC	许梓宸 (xuzichen)	6ms	6.6 MiB	C++17(O2)	263 Bytes	2024-7-17 16:02:26
AC	张瑞博	6ms	6.9 MiB	C++11	208 Bytes	2024-5-20 21:58:37
AC	中岛敦 (黄麒瑞)	6ms	6.7 MiB		284 Bytes	2023-9-30 21:23:09
AC	雷文博（帅哥） (18983951391)	6ms	392 KiB		284 Bytes	2023-4-3 20:42:12
AC	LukeDid	6ms	428 KiB		301 Bytes	2023-4-22 18:52:34
AC	CK (李弘毅)	6ms	7.2 MiB	C++11(O2)	301 Bytes	2024-5-4 13:20:20
AC	qwq	6ms	444 KiB		229 Bytes	2022-7-7 12:46:00
AC	雷文博（帅哥） (18983951391)	6ms	384 KiB		284 Bytes	2023-4-3 20:42:01
AC	stehpen_zuo	6ms	7.2 MiB	C++20	407 Bytes	2024-5-18 1:00:44
AC	炸鱼4000+ (dxc)	6ms	6.9 MiB	C++14(O2)	278 Bytes	2024-6-30 21:53:04
AC	qinyi	6ms	392 KiB		219 Bytes	2022-3-7 19:06:29
AC	李树崑 (lishukun)	6ms	392 KiB		377 Bytes	2022-1-26 23:04:17
AC	huanghaoming	6ms	384 KiB		266 Bytes	2022-9-11 20:47:54
AC	Yangshenxin (𝒲𝒶𝓉𝑒𝓇)	6ms	392 KiB		346 Bytes	2022-1-23 18:50:33
AC	三藏的痔疮 (不会玩是原罪)	6ms	392 KiB		277 Bytes	2022-1-26 7:42:36
AC	huyinuo	6ms	384 KiB		229 Bytes	2022-4-17 9:37:10
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	7ms	384 KiB		200 Bytes	2023-4-24 21:07:16
AC	ycy	7ms	432 KiB		266 Bytes	2022-7-17 10:12:12
AC	王祎辰 (wangyichen)	7ms	6.9 MiB		328 Bytes	2023-7-16 14:59:20
AC	CK (李弘毅)	7ms	7.2 MiB	C++17(O2)	301 Bytes	2024-5-4 13:20:52
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)	7ms	384 KiB		285 Bytes	2023-5-12 20:10:05
AC	雷文博（帅哥） (18983951391)	7ms	384 KiB		284 Bytes	2023-4-3 20:41:58
AC	CK (李弘毅)	7ms	7.2 MiB	C++98(O2)	301 Bytes	2024-5-4 13:20:35
AC	刘政君 (lzj)	7ms	392 KiB		339 Bytes	2022-8-31 14:52:15
AC	胡澜之 (666hlz666)	7ms	6.8 MiB		389 Bytes	2023-10-26 17:06:05
AC	宋坤霖	7ms	7.1 MiB	C++11	273 Bytes	2024-4-20 13:21:29
AC	雷文博（帅哥） (18983951391)	7ms	384 KiB		284 Bytes	2023-4-3 20:41:57
AC	王玺懿 (wxy)	7ms	440 KiB		225 Bytes	2022-7-29 13:45:30
AC	杨皓宇 (yanghaoyu)	7ms	6.8 MiB		301 Bytes	2023-10-21 8:42:45
AC	Jack	7ms	436 KiB		226 Bytes	2022-8-2 17:15:38
AC	芒苒忧 (廖迦南)	7ms	392 KiB		273 Bytes	2022-1-25 14:54:10
AC	heyuzhe	7ms	6.9 MiB	C++98	218 Bytes	2024-8-16 8:34:20
AC	冯隆浩（小号）	7ms	432 KiB		269 Bytes	2022-7-24 17:17:18
AC	郑尧 (zhengyao)	7ms	6.9 MiB	C++98	227 Bytes	2024-6-12 19:50:04
AC	赵鑫宸 (xiaoxiao721)	7ms	444 KiB		243 Bytes	2022-2-20 3:14:14
AC	21035-wyf	7ms	384 KiB		198 Bytes	2022-7-6 9:32:43
AC	dengfeng	7ms	384 KiB		332 Bytes	2022-2-17 15:50:50
AC	时代二校-焦雨齐 (Angel)	7ms	6.7 MiB	C++11	318 Bytes	2024-7-20 17:12:03
AC	郑尧 (zhengyao)	7ms	6.9 MiB	C++98	227 Bytes	2024-6-12 19:50:11
AC	汪致卉 (wangzh)	7ms	384 KiB		246 Bytes	2022-1-22 18:59:00
AC	雷文博（帅哥） (18983951391)	7ms	512 KiB		284 Bytes	2023-4-3 20:42:00
AC	秦子越 (13883322087)	7ms	384 KiB		294 Bytes	2022-2-8 18:14:16