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

 实验目的

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

 实验要求



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

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

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


SERVER TIME : 2025-09-19 17:11:04
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
1728542022211422star10032
C
Accepted
2180KB
3ms
C++5430 bytes2023-10-17 21:27:53
1728412022211422star10032
C
Runtime Error
2180KB
2ms
C++5413 bytes2023-10-17 21:21:42
1728362022211422star10032
C
Runtime Error
2180KB
3ms
C++5411 bytes2023-10-17 21:18:46
1727442022211422star10032
C
Runtime Error
2176KB
2ms
C++4752 bytes2023-10-17 19:44:28
1721902022211422star10032
B
Accepted
2180KB
3ms
C++1729 bytes2023-10-16 22:26:40
1721802022211422star10032
B
Wrong Answer
2180KB
3ms
C++1715 bytes2023-10-16 22:20:47
1721222022211422star10032
A
Accepted
2176KB
2ms
C++1097 bytes2023-10-16 21:52:29
1721202022211422star10032
A
Wrong Answer
2176KB
2ms
C++1078 bytes2023-10-16 21:51:05
1717982022211422star10032
A
Wrong Answer
2176KB
2ms
C++1078 bytes2023-10-16 16:56:43