HDU-1022 Train Problem I

# include<stdio.h>
# include<string.h>
# include<algorithm>
# include<stack>
# include<iostream>
using namespace std;
char a[10];
char b[10];
int flag[20];
int main(){
	int i,j,num,n;

	while(scanf("%d",&n)!=EOF){
			i=j=num=0;
		stack<char>s;
		scanf("%s",a);
		scanf("%s",b);
		while(j<n){
			if(s.empty()||s.top()!=b[j]&&i<n){
				s.push(a[i]);
				flag[num++]=1;
				i++;
			}
			else{
				if(s.top()==b[j]){
					s.pop();
					j++;
					flag[num++]=0;
				}
				else{
					break;
				}
			}
		}
		if(s.empty()){
			printf("Yes.\n");
			for(i=0;i<num;i++){
				if(flag[i]==1){
					printf("in\n");
				}
				else{
					printf("out\n");
				}
			}
			printf("FINISH\n");
		}
		else{
			printf("No.\n");
			printf("FINISH\n");
		}
	}
	return 0;
}