假设停在铁路调度站（如教科书中图3.1(b)所示）入口处的车厢序列的编号依次为1,2,3,…,n。设计一个程序，求出所有可能由此输出的长度为n的车厢序列。

首先在教科书3.1.2节中提供的栈的顺序存储结构SqStack之上实现栈的基本操作，即实现栈类型。程序对栈的任何存取（即更改，读取和状态判别等操作）必须借助于基本操作进行。

-Railway Station stop scheduling assumptions (such as textbooks in 3.1 (b) below) at the entrance of the car sequence numbers were 1,2,3, ..., n. Design a program, find all the possible resulting output sequence of length n of the car. First, section 3.1.2 in the textbook to provide the stack implemented on top of the order of the storage structure SqStack the basic operation of the stack, that stack types to achieve. Procedures on the stack of any access (that is, changing, reading and state discrimination and other operations) must be carried out by means of basic operations.