输出星期几

状态	递交者	时间	内存	语言	代码	递交时间
AC	SYC0226	14ms	440 KiB		388 Bytes	2022-3-13 13:06:21
AC	xuaonan	14ms	504 KiB		460 Bytes	2022-10-4 18:00:34
AC	王泓涵 (whh)	14ms	424 KiB		357 Bytes	2022-7-10 11:02:22
AC	zhr	14ms	432 KiB		472 Bytes	2023-4-9 11:54:55
AC	六 (江智昕)	14ms	384 KiB		472 Bytes	2022-12-30 19:35:06
AC	奇怪的正义人！ (leweiqi)	14ms	384 KiB		359 Bytes	2023-3-26 17:09:19
AC	繁星 (05c35-zzm)	14ms	432 KiB		674 Bytes	2022-8-18 11:56:29
AC	源著校区-宋昊成 (马冬梅)	14ms	512 KiB		415 Bytes	2023-2-25 17:21:45
AC	刘锦航	14ms	392 KiB		684 Bytes	2022-8-28 20:35:51
AC	缥 (王硕2012)	14ms	440 KiB		486 Bytes	2022-10-3 16:51:57
AC	WangXi	14ms	392 KiB		485 Bytes	2022-9-17 19:30:15
AC	诸禹吉 (zhuyuji)	14ms	440 KiB		451 Bytes	2022-8-3 23:15:52
AC	雷承翰1	14ms	384 KiB		443 Bytes	2023-3-11 20:27:26
AC	六 (江智昕)	14ms	384 KiB		472 Bytes	2022-12-30 19:35:08
AC	时代一校-赵彦博 (zyb)	14ms	436 KiB		398 Bytes	2022-9-24 22:30:38
AC	Guest	14ms	6.8 MiB		470 Bytes	2023-10-19 18:34:30
AC	六 (江智昕)	14ms	400 KiB		472 Bytes	2022-12-30 19:35:07
AC	谭懿轩 (yanyixuan)	14ms	424 KiB		342 Bytes	2022-2-14 22:14:19
AC	潘光瑞 (NB牛牛大师)	14ms	440 KiB		478 Bytes	2022-8-10 11:44:32
AC	hyh22031	14ms	392 KiB		358 Bytes	2022-10-20 20:42:20
AC	yanglang	14ms	440 KiB		331 Bytes	2022-10-21 15:08:29
AC	新壹街校区-杨轩懿 (杨轩懿1)	14ms	6.7 MiB		326 Bytes	2023-8-28 9:29:51
AC	六 (江智昕)	14ms	384 KiB		472 Bytes	2022-12-30 19:35:06
AC	什蒂尔布 (吴东航)	14ms	512 KiB		515 Bytes	2022-7-27 16:32:21
AC	六 (江智昕)	14ms	384 KiB		472 Bytes	2022-12-30 19:35:07
AC	杨瀚霖 (yanghanlin)	14ms	384 KiB		473 Bytes	2022-11-19 11:24:07
AC	pandap&a王皓宸 (WANGHAOCHEN)	14ms	432 KiB		418 Bytes	2022-11-8 17:33:44
AC	六 (江智昕)	14ms	384 KiB		472 Bytes	2022-12-30 19:35:04
AC	余多多29	14ms	416 KiB		514 Bytes	2023-4-17 22:40:41
AC	六 (江智昕)	14ms	384 KiB		472 Bytes	2022-12-30 19:35:08
AC	梅子楠 (22016-mzn)	15ms	6.9 MiB		397 Bytes	2023-7-16 15:14:49
AC	Him (李俊熙)	15ms	7 MiB	C++98	430 Bytes	2024-6-14 19:58:49
AC	南坪校区-郑力博 (zhenglibo23003)	15ms	436 KiB		344 Bytes	2023-3-1 20:40:18
AC	yxj	15ms	448 KiB		375 Bytes	2022-10-20 15:15:56
AC	明哲瀚 (18580067605)	15ms	392 KiB		520 Bytes	2022-10-7 19:04:04
AC	huanglu	15ms	7 MiB		342 Bytes	2023-7-15 14:10:11
AC	时代一校林星宇 (lxy)	15ms	436 KiB		397 Bytes	2022-11-26 22:30:21
AC	明哲瀚 (18580067605)	15ms	384 KiB		520 Bytes	2022-10-7 19:04:04
AC	偽艺術家 (chenyanchi22006)	15ms	432 KiB		342 Bytes	2022-6-23 22:14:00
AC	宋坤霖	15ms	7.1 MiB	C++11	403 Bytes	2024-4-20 13:20:43
AC	刘致言	15ms	428 KiB		395 Bytes	2023-3-11 9:21:31
AC	zzl	15ms	6.8 MiB		332 Bytes	2023-11-6 21:01:02
AC	金锦泽 (jinjinze)	15ms	6.8 MiB		366 Bytes	2023-10-3 10:56:33
AC	曾龙兮	15ms	384 KiB		476 Bytes	2022-9-25 19:02:31
AC	刘洋	15ms	6.7 MiB		403 Bytes	2023-8-25 12:18:19
AC	六 (江智昕)	15ms	384 KiB		472 Bytes	2022-12-30 19:35:03
AC	甄一阳 (22016-zyy)	15ms	512 KiB		441 Bytes	2022-10-30 11:18:11
AC	周琪渃	15ms	432 KiB		429 Bytes	2022-10-29 16:07:01
AC	新壹街校区-周士杰 (zsj)	15ms	512 KiB		410 Bytes	2022-3-4 19:57:05
AC	坤坤荔枝小黑子 (zhonghaotian22006)	15ms	436 KiB		376 Bytes	2022-9-6 20:38:46
AC	秦兴润	15ms	6.8 MiB		444 Bytes	2023-6-28 14:50:24
AC	六 (江智昕)	15ms	384 KiB		472 Bytes	2022-12-30 19:35:05
AC	yuhaodi	15ms	432 KiB		521 Bytes	2023-4-24 18:33:29
AC	刘锦航	15ms	432 KiB		431 Bytes	2022-4-23 20:17:27
AC	彭熙芮	15ms	6.7 MiB		363 Bytes	2023-9-4 20:53:39
AC	yixingyou	15ms	440 KiB		372 Bytes	2022-10-27 16:28:59
AC	我很6 (zjj22031)	15ms	384 KiB		477 Bytes	2022-10-20 20:33:41
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)	15ms	428 KiB		393 Bytes	2022-10-3 16:06:41
AC	时代1校-杨宇轩 (杨宇轩)	15ms	6.9 MiB		365 Bytes	2023-8-21 12:30:57
AC	星野光 (Hoshino Hikari)	15ms	6.8 MiB		864 Bytes	2023-10-20 22:45:48
AC	六 (江智昕)	15ms	384 KiB		472 Bytes	2022-12-30 19:35:04
AC	六 (江智昕)	15ms	392 KiB		472 Bytes	2022-12-30 19:35:08
AC	新壹街校区--税崇峻 (税崇峻)	15ms	6.9 MiB		366 Bytes	2023-7-27 15:08:21
AC	付博plus	15ms	512 KiB		441 Bytes	2022-8-23 12:31:10
AC	龙思颖 (lsy)	15ms	440 KiB		420 Bytes	2023-3-7 20:34:55
AC	Billy52013 (李子轩)	15ms	6.8 MiB		387 Bytes	2023-10-6 14:49:54
AC	U城校区-郭旻哲 (郭旻哲)	15ms	6.7 MiB		477 Bytes	2023-9-3 21:57:48
AC	enen	15ms	512 KiB		341 Bytes	2023-4-8 11:38:38
AC	罗莎莎	15ms	7 MiB		421 Bytes	2023-7-20 17:05:20
AC	高国瑞	15ms	6.9 MiB		374 Bytes	2023-7-15 20:23:44
AC	新壹街校区-杨轩懿 (杨轩懿1)	15ms	6.9 MiB		326 Bytes	2023-7-16 10:32:46
AC	李山水	15ms	512 KiB		533 Bytes	2022-8-28 19:39:38
AC	11451254188 (22029-mjh)	15ms	432 KiB		380 Bytes	2022-12-3 9:41:32
AC	李旻轩	15ms	440 KiB		576 Bytes	2023-3-2 19:15:26
AC	贾鑫豪 (Mr Sam)	15ms	428 KiB		455 Bytes	2022-8-28 10:48:59
AC	ganlin1	15ms	7.4 MiB		423 Bytes	2023-7-12 14:22:54
AC	zcx	15ms	524 KiB		385 Bytes	2022-10-12 17:41:45
AC	颜梓宇	15ms	6.8 MiB		774 Bytes	2023-6-22 16:35:27
AC	司雨来 (siyulai)	15ms	436 KiB		473 Bytes	2022-10-6 16:36:03
AC	@ CQ09CPCOO22020 (deng ming yu)	15ms	416 KiB		415 Bytes	2022-11-19 12:58:46
AC	南坪校区-龙浩睿 (longhaorui)	15ms	7.2 MiB		458 Bytes	2023-12-31 15:45:55
AC	杨皓宇 (杨浩宇)	15ms	436 KiB		382 Bytes	2022-8-25 19:48:01
AC	lihaoyi	15ms	420 KiB		521 Bytes	2022-10-16 11:11:06
AC	德克萨斯做的到吗 (liyangbao)	15ms	512 KiB		440 Bytes	2022-10-30 23:42:27
AC	zyq1	15ms	384 KiB		472 Bytes	2023-4-17 22:04:09
AC	zhangxs	15ms	6.8 MiB		393 Bytes	2023-6-18 16:24:26
AC	车涌强	15ms	6.9 MiB		375 Bytes	2023-6-17 16:51:18
AC	六 (江智昕)	15ms	384 KiB		472 Bytes	2022-12-30 19:35:05
AC	六 (江智昕)	15ms	384 KiB		472 Bytes	2022-12-30 19:35:05
AC	Turorany (郑浩然)	15ms	7.2 MiB		429 Bytes	2023-11-30 20:10:36
AC	曲奇饼干	15ms	384 KiB		352 Bytes	2022-12-27 15:35:35
AC	wzzjnb2012	15ms	436 KiB		274 Bytes	2022-9-26 23:07:43
AC	明哲瀚 (18580067605)	15ms	420 KiB		520 Bytes	2022-10-7 19:04:03
AC	陈家齐 (陈家齐1)	15ms	512 KiB		477 Bytes	2023-3-17 21:50:37
AC	黄梓桐 (HuangZiTong)	15ms	432 KiB		338 Bytes	2022-10-24 21:16:33
AC	贾博涵	15ms	6.8 MiB		316 Bytes	2023-11-6 15:04:44
AC	六 (江智昕)	15ms	384 KiB		472 Bytes	2022-12-30 19:35:03
AC	﹢•﹡🕉☽✝⚜Halanfus⚜✝☾⚔⚝﹡﹢• (黄子瑞)	15ms	6.7 MiB		370 Bytes	2023-8-23 10:57:13
AC	希蒙 (zhengxingya)	15ms	6.9 MiB		443 Bytes	2023-7-24 19:55:07
AC	童艺涵	15ms	436 KiB		442 Bytes	2022-12-7 20:49:27