#include<iostream>
#include<stdlib.h>
using namespace std;
#define Stack_size 20 //栈大小
typedef struct double_Stacke{int Stack[Stack_size];int top[2];
}double_Stacke;double_Stacke *init(){ //双端栈初始化double_Stacke *S=(double_Stacke *)malloc(sizeof(double_Stacke));S->top[0]=-1;S->top[1]=Stack_size;return S;
}
int push(double_Stacke *S,int num,int i){//i：进入哪一号栈if((S->top[0]+1)!=S->top[1]){switch(i){case 0:S->top[0]++;S->Stack[S->top[0]]=num;return 1;break;case 1:S->top[1]--;S->Stack[S->top[1]]=num;return 1;break;default:return -1;}}return -1;
}
int pop(double_Stacke *S,int i){//i：进入哪一号栈switch(i){case 0:if(S->top[0]!=-1){int x=S->Stack[S->top[0]];S->top[0]--;return x;}return -99999;break;case 1:if(S->top[1]!=Stack_size){int x=S->Stack[S->top[1]];S->top[1]++;return x;}return -99999;break;default:return -99999;}return -99999;
}
void print(double_Stacke *S,int i){//i:输出第几号栈switch(i){case 0:if(S->top[0]!=-1){for(int k=S->top[0];k>=0;k--){cout<<S->Stack[k]<<" ";}cout<<endl;return ;}cout<<"空"<<endl;break;case 1:if(S->top[1]!=Stack_size){for(int k=S->top[1];k<Stack_size;k++){cout<<S->Stack[k]<<" ";}cout<<endl;return;}cout<<"空"<<endl;break;}
}
int main(int argc, char const *argv[])
{double_Stacke *S;S=init();print(S,0);// cout<<"push "<<push(S,5,0)<<endl;// cout<<"push "<<push(S,6,0)<<endl;// cout<<"push "<<push(S,7,0)<<endl;// print(S,0);// cout<<"pop "<<pop(S,0)<<endl;// print(S,0);cout<<"push "<<push(S,12,1)<<endl;cout<<"push "<<push(S,13,1)<<endl;cout<<"push "<<push(S,14,1)<<endl;print(S,1);cout<<"pop "<<pop(S,1)<<endl;print(S,1);return 0;
}