hdoj 1022 Train Problem I

 #include<stdio.h>
 int main()
 {
     int n,i,j,k;
     char in[],out[];
     int flag[];
     while(scanf("%d %s %s",&n,in,out)!=EOF)
     {
         char stack[];//stack维持着正常的进出栈
         int top=-;//栈顶
         i=j=k=;
         while(j<n+&&i<n)
         {
             if(top!=-1&&stack[top]==out[i])
             {
                 top--;
                 flag[k]=;
                 k++;
                 i++;
             }
             else
             {
                 top++;
                 flag[k]=;
                 k++;
                 stack[top]=in[j];
                 j++;
             }
         }
         if(k!=*n)
             printf("No.\n");
         else
         {
             printf("Yes.\n");
             for(i=; i<n*; i++)
             {
                 if(flag[i])
                     printf("in\n");
                 else
                     printf("out\n");
             }
         }
         printf("FINISH\n");

     }
     return ;
 }