CONTEST ID : 1220 - 栈、队列与递归算法设计

 实验目的

仅仅认识到栈和队列是两种特殊的线性表是远远不够的，本次实验的目的在于使学生深入了解栈和队列的特征，以便在实际问题背景下灵活运用它们；同时还将巩固这两种结构的构造方法，接触较复杂问题的递归算法设计。

 实验要求



1）  编程实现必做实验内容 1267, 1268。

2）  学生可根据自己的能力选做实验内容 1269。

3）  填写实验报告（见教学云）。


SERVER TIME : 2025-09-19 12:54:06
Finished

STATUS : End    OPEN : Private
Start Time : 2023-10-15 16:00:00
End Time : 2023-10-23 16:00:00

ProblemSet Submit Standing OIStanding Statistics IP VERIFICATION

Problem ID    User    Language    Result   

RunID User Nick Name Problem ID Result Memory Time Language Code Length Submit Time
1743372022211434CyberRichkid
C
Accepted
2180KB
2ms
C++4009 bytes2023-10-19 19:05:01
1743012022211434CyberRichkid
C
Wrong Answer
2180KB
3ms
C++3810 bytes2023-10-19 18:08:50
1740432022211434CyberRichkid
B
Accepted
2180KB
2ms
C++1511 bytes2023-10-19 11:18:45
1740352022211434CyberRichkid
B
Accepted
2180KB
3ms
C++817 bytes2023-10-19 11:08:59
1740342022211434CyberRichkid
B
Wrong Answer
2180KB
3ms
C++1195 bytes2023-10-19 11:04:47
1740332022211434CyberRichkid
B
Compile Error
0KB
0ms
C++1186 bytes2023-10-19 11:03:14
1740052022211434CyberRichkid
A
Accepted
2176KB
2ms
C++1283 bytes2023-10-19 10:21:20
1739992022211434CyberRichkid
A
Compile Error
0KB
0ms
C++1272 bytes2023-10-19 10:18:20
1739982022211434CyberRichkid
A
Compile Error
0KB
0ms
C++1272 bytes2023-10-19 10:16:41