NYOJ 150 栈

#include <stdio.h>#include <string.h>int main (){    char a[15],b[15];    int n,i,stack[15];    int flag [30],k,j,top;    while (~scanf("%d%s%s",&n,a,b))    {        k=top=j=0;        for(i=0;i<n;i++)        {            stack[++top]=a[i];            flag[k++]=1;            while (top&&stack[top]==b[j])            {                flag[k++]=0;                top--;                j++;            }        }        if(j==n)        {            printf("Yes.\n");            for(i=0;i<2*n;i++)            {                if(flag[i])                printf("in\n");                else                printf("out\n");            }        }        else            printf("No.\n");        printf("FINISH\n");    }    return 0;}