Train Problem I HDU

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. 
  

Input

The input contains several test cases. Each test case consists of an integer, the number of trains, and two strings, the order of the trains come in:O1, and the order of the trains leave:O2. The input is terminated by the end of file. More details in the Sample Input. 

Output

The output contains a string "No." if you can't exchange O2 to O1, or you should output a line contains "Yes.", and then output your way in exchanging the order(you should output "in" for a train getting into the railway, and "out" for a train getting out of the railway). Print a line contains "FINISH" after each test case. More details in the Sample Output. 

Sample Input

3 123 3213 123 312

Sample Output

Yes.inininoutoutoutFINISHNo.FINISH  
//此题不真正的仔细读难理解出事栈的应用，容易想成反序相等就yes的问题，此题题意是说输入的两列字符串，第一列表示进入的顺序，第二列表示出去的顺序，问你是否符合后进先出。
//举出一列数据 7 1234567 4321576
//上面数据应该是 in in in in out out out out in out in in out out；
所以不是反序才行 可以进到一半就出的         

#include <iostream>#include <iostream>#include <cstdio>#include <string.h>#include <queue>#include <stack>using namespace std;int main(){    int n;    while(cin>>n)    {        char a[10000],b[10000];        stack<char>s;        scanf("%s%s",a,b);        int flag[10000];        int j=0,count=0;        for(int i=0;i<n;i++)        {            s.push(a[i]);            flag[count]=1;  //用数组来记录进出顺序 count代表一次进/出            count++;            while(j<n&&!s.empty())  //j用来表示出到第几个             {                if(s.top()==b[j])    //栈顶元素与出的那边匹配                {                    s.pop();                    flag[count]=0;   //表示出站                    count++;                    j++;                }                else        //如果不相等别在while里循环了换下一个看是否匹配                {                    break;                }            }        }        if(s.empty())        {            printf("Yes.\n");            for(int i=0;i<count;i++)         {            if(flag[i])            printf("in\n");            else printf("out\n");         }        }        else          printf("No.\n");        printf("FINISH\n");    }    return 0;}