hdu1022

添加链接描述

#include<bits/stdc++.h>
using namespace std;
int n;
char o1[1010],o2[1010];
stack<char> st;//根据题目输入要求，需要定义成字符型
queue<string> q;//队列用于存放in，out 
int main()
{
	while(cin>>n){
		//清空栈和队列
		while(!st.empty()) st.pop();
		while(!q.empty()) q.pop();
		scanf("%s%s",&o1,&o2);
		int top=0,a,b;//top标记o2数组的下标 
		for(int i=0;i<n;i++){
			st.push(o1[i]);
			q.push("in");
			while(!st.empty()&&st.top()==o2[top]){
				q.push("out");
				st.pop();
				top++;
			}
		}
		if(st.empty()){
			cout<<"Yes."<<endl;
			while(!q.empty()){
				cout<<q.front()<<endl;
				q.pop();
			}
		}
		else cout<<"No."<<endl;
		cout<<"FINISH"<<endl;
	}
	return 0;
}