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

 实验目的

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

 实验要求



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

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

3)  填写实验报告(见教学云)。


SERVER TIME : 2025-09-19 09:33:02
Finished

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


Problem ID    User    Language    Result   

RunID User Nick Name Problem ID Result Memory Time Language Code Length Submit Time
1740492022211488SpikeyAccepted
2176KB
1ms
C++2914 bytes2023-10-19 11:32:33
1725562022211488SpikeyAccepted
2344KB
3ms
C++2132 bytes2023-10-17 14:12:03
1723762022211488SpikeyWrong Answer
2344KB
1ms
C++2001 bytes2023-10-17 02:22:27
1723752022211488SpikeyWrong Answer
2344KB
3ms
C++2001 bytes2023-10-17 02:20:26
1723742022211488SpikeyWrong Answer
2344KB
3ms
C++1930 bytes2023-10-17 02:09:24
1723732022211488SpikeyWrong Answer
2344KB
2ms
C++1932 bytes2023-10-17 02:07:49
1723722022211488SpikeyOutput Limit Exceed
2344KB
4ms
C++1950 bytes2023-10-17 02:06:35
1723712022211488SpikeyOutput Limit Exceed
2180KB
2ms
C++1719 bytes2023-10-17 02:04:24
1721742022211488SpikeyAccepted
2176KB
2ms
C++1059 bytes2023-10-16 22:17:17
1721692022211488SpikeyWrong Answer
2176KB
2ms
C++1100 bytes2023-10-16 22:15:55
1719922022211488SpikeyWrong Answer
2176KB
3ms
C++1099 bytes2023-10-16 20:12:35