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

 实验目的

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

 实验要求



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

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

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


SERVER TIME : 2025-09-19 10:54:19
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
1766192022211441yunxiao
C
Wrong Answer
2180KB
3ms
C++2847 bytes2023-10-22 18:33:51
1764712022211441yunxiao
B
*Accepted174035
2180KB
2ms
C++1349 bytes2023-10-22 16:01:08
1764692022211441yunxiao
B
Wrong Answer
2180KB
2ms
C++1153 bytes2023-10-22 15:59:14
1763572022211441yunxiao
A
Accepted
2176KB
2ms
C++102 bytes2023-10-22 14:40:51
1763542022211441yunxiao
A
Accepted
2180KB
2ms
C++1005 bytes2023-10-22 14:38:46
1763532022211441yunxiao
A
Wrong Answer
2180KB
2ms
C++1063 bytes2023-10-22 14:37:31
1763432022211441yunxiao
A
Wrong Answer
2180KB
3ms
C++836 bytes2023-10-22 14:28:01
1763382022211441yunxiao
A
Wrong Answer
2180KB
3ms
C++1063 bytes2023-10-22 14:24:40
1763372022211441yunxiao
A
Wrong Answer
2180KB
2ms
C++1085 bytes2023-10-22 14:23:43
1763352022211441yunxiao
A
Compile Error
0KB
0ms
C1085 bytes2023-10-22 14:23:18