SDUT - 3335 数据结构实验之栈与队列八：栈的基本操作

#include <stdio.h>
#include <stdlib.h>
int a[105], p = 0;
int main()
{
    int t, n, m, i, k, data;
    char cmd;
    scanf("%d", &t);
    while(t--)
    {
        p = 0;
        scanf("%d %d", &m, &n);
        for(k = 0; k < n; k++)
        {
            getchar();
            scanf("%c", &cmd);
            if(cmd == 'P')
            {
                scanf("%d", &data);
                if(p == m)printf("F\n");
                else a[p++] = data;
            }
            else if(cmd == 'A')
            {
                if(p == 0)printf("E\n");
                else printf("%d\n", a[p - 1]);
            }
            else if(cmd == 'O')
            {
                if(p == 0)printf("E\n");
                else printf("%d\n", a[--p]);
            }
        }
        printf("\n");
    }
    return 0;
}