VJ_Train Problem I _stack

Train Problem I

//
//#include<bits/stdc++.h>
#include<iostream>
#include<vector>
#include<stack>
#include<string>
using namespace std;

int main()
{
    vector<string> v;
    stack<char> sk;
    string s1,s2;
    int n,i,j;

    while( cin>>n>>s1>>s2 )
    {
        while( sk.size() ) sk.pop();
        v.clear();
        j=0;
        for( i=0;i<s1.size();i++ )
        {
            while( sk.size() && sk.top()==s2[j] )
                { v.push_back( "out" ); sk.pop(); j++; }

            if( sk.size()<n )
            {
                sk.push( s1[i] );
                v.push_back( "in" );
            }
            else break;
        }                                    // 补一个判断
        while( sk.size() && sk.top()==s2[j] )
            { v.push_back( "out" ); sk.pop(); j++; }

        if( j==s2.size() )
        {
            cout<<"Yes."<<endl;
            for( i=0;i<v.size();i++ )
                cout<<v[i]<<endl;
        }
        else cout<<"No."<<endl;

        cout<<"FINISH"<<endl;
    }
    return 0;
}