Train Problem I

As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the fastest all over the world ^v^). But here comes a problem, there is only one railway where all the trains stop. So all the trains come in from one side and get out from the other side. For this problem, if train A gets into the railway first, and then train B gets into the railway before train A leaves, train A can't leave until train B leaves. The pictures below figure out the problem. Now the problem for you is, there are at most 9 trains in the station, all the trains has an ID(numbered from 1 to n), the trains get into the railway in an order O1, your task is to determine whether the trains can get out in an order O2.

  
  

   3 123 321
3 123 312
  
  

  
  

   Yes.
in
in
in
out
out
out
FINISH
No.
FINISH


   
   


    
    

     
     Hint
    
    
Hint
   
   

    
For the first Sample Input, we let train 1 get in, then train 2 and train 3.
So now train 3 is at the top of the railway, so train 3 can leave first, then train 2 and train 1.
In the second Sample input, we should let train 3 leave first, so we have to let train 1 get in, then train 2 and train 3.
Now we can let train 3 leave.
But after that we can't let train 1 leave before train 2, because train 2 is at the top of the railway at the moment.
So we output "No.".
  
  

#include<stdio.h>
#include<iostream>
#include<stack>
using namespace std;
int c[10];
char a[10],b[10];
int main()
{
    int n;
    stack<char>S;
    while(scanf("%d",&n)!=EOF)
    {
        int k=0,j=0,i;
        scanf("%s",a);
        scanf("%s",b);
        for(i=0; i<n; i++)
        {
            S.push(a[i]);
            c[k]=1;
            k++;
        while(j<n&&!S.empty())
        {
            if(S.top()==b[j])
            {
                S.pop();
                c[k]=0;
                j++;
                k++;
            }
                else
                break;

        }
      }
            if(S.empty())
            {
                printf("Yes.\n");
                for(i=0; i<k; i++)
                {
                    if(c[i]==0)   printf("out\n");
                    else if(c[i]==1)   printf("in\n");
                }
            }
            else
                printf("No.\n");
            printf("FINISH\n");
            while(!S.empty())
              S.pop();

    }
    return 0;
}