1022 Train Problem I

<span style="font-family: Arial, Helvetica, sans-serif;">#include <cstdlib></span>

#include <iostream>
#include <string>
#include <cstring>
#include<stdio.h>
using namespace std;

char s1[12];
char s2[12];
char s3[25][5];
char stack[12];

int main()
{
    int n,ptr1,ptr2,ptr3,ptr4;
    while(scanf("%d",&n)==1)
    {
        bool x=true;
        scanf("%s%s",&s1,&s2);
        ptr1=ptr2=ptr3=ptr4=0;
        stack[ptr3]=s1[ptr1];
        strcpy(s3[ptr4],"in");
        while(true)
        {
            if(ptr3<0&&ptr1==n-1) break;
            if(ptr3>=0&&stack[ptr3]==s2[ptr2])
            {
                strcpy(s3[++ptr4],"out");
                ptr2++;
                ptr3--;
            }
            else if(ptr1<n)
            {
                stack[++ptr3]=s1[++ptr1];
                strcpy(s3[++ptr4],"in");
            }
            else
            {
                x=false;
                break;
            }
        }
        if(!x) printf("No.\n");
        else
        {
            printf("Yes.\n");
            for(int i=0;i<2*n;i++)
                printf("%s\n",s3[i]);
        }
        printf("FINISH\n");
    }
    return 0;
}