HDJ -- 1022 

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<string>
 4 #define MAXN 10 
 5 using namespace std; 
 6 int s[MAXN], p[MAXN]; 
 7 string in, out; 
 8 int main(){
 9     int n, flag, k, i, j, top; 
10     while(~scanf("%d", &n)){
11         cin >> in >> out; 
12         k = flag = i = j = top = 0; 
13         while(i < n){
14             if(top && s[top] == out[i]){
15                 i++; 
16                 top--; 
17                 p[k++] = 0; 
18             }else if(j < n){
19                 s[++top] = in[j++]; 
20                 p[k++] = 1; 
21             }else{
22                 flag = 1; 
23                 break; 
24             }
25         }
26         if(!flag){
27             printf("Yes.\n"); 
28             for(int i = 0; i < k; i ++) printf("%s\n", p[i] == 1 ? "in" : "out");
29             printf("FINISH\n"); 
30         }else printf("No.\nFINISH\n"); 
31     }
32     return 0; 
33 }

 

posted on 2014-04-18 14:58  ~Love()  阅读(132)  评论(0)    收藏  举报

导航