hduoj Train Problem I-1022

细节！！！！！！！！！！！！！！！！！！

#include<stdio.h>#include<stack>#include<stdlib.h>#include<string.h>using namespace std;stack<char> s1;int main(){int n;char str1[1000],str2[1000],falg[1000];while(~scanf("%d %s %s",&n,str1,str2)){memset(falg,-1,sizeof(falg[0]));while(s1.empty()==false){s1.pop();}int j=0,num=0;for(int i=0;i<strlen(str1);i++){s1.push(str1[i]);falg[num]=1;num++;//printf("IN\n");if(s1.top()==str2[j]){while(!s1.empty()&&s1.top()==str2[j]){s1.pop();//printf("Out\n");j++;falg[num]=0;num++;}}}/*while(!s1.empty()){printf("%c ",s1.top());s1.pop();}*/if(j==n){printf("Yes.\n");for(int i=0;i<num;i++){if(falg[i]==1) printf("in\n");else printf("out\n");}}else{printf("No.\n");}printf("FINISH\n");}return 0;}