PTA数据结构与算法中文-在一个数组中实现两个堆栈

测试：

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define ERROR 1e8
typedef int ElementType;
typedef enum {
    push, pop, end } Operation;
typedef enum {
    false, true } bool;
typedef int Position;
struct SNode {
   
	ElementType *Data;
	Position Top1, Top2;
	int MaxSize;
};
typedef struct SNode *Stack;

Stack CreateStack( int MaxSize );
bool Push( Stack S, ElementType X, int Tag );
ElementType Pop( Stack S, int Tag );

Operation GetOp();  /* details omitted */
void PrintStack( Stack S, int Tag ); /* details omitted */

int main() {
   
	int N, Tag, X;
	Stack S;
	int done = 0;

	scanf("%d", &N);
	S = CreateStack(N);
	while ( !done ) {
   
		switch( GetOp() ) {
   
			case push:
				scanf("%d %d", &Tag, &X);
				if (!Push(S, X, Tag)) 
					printf("Stack %d is Full!\n", Tag);
				break;
			case pop:
				scanf("%d", &Tag)