Dotcpp  >  编程题库  >  [STL训练]Train Problem I
题目 2063:

[STL训练]Train Problem I

时间限制: 1Sec 内存限制: 128MB 提交: 533 解决: 159

题目描述

As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train  (because the trains in the Ignatius Train Station is the fastest allover the world ^v^). But here comes a problem, there is only one railway where all the trains stop. So all the trains come in from one  side and get out from the other side. For this problem, if train A gets into the railway first, and then train B gets into the railway
before train A leaves, train A can't leave until train B leaves. The pictures below figure out the problem. Now the problem for you is,there are at most 9 trains in the station, all the trains has an ID(numbered from 1 to n), the trains get into the railway in an order O1, your task is to determine whether the trains can get out in anorder O2.

输入格式

The input contains several test cases. Each test case consists of an integer, the number of trains, and two strings, the order of the trains come in:O1, and the order of the trains leave:O2. The input is terminated by the end of file. More details in the Sample Input.

输出格式

The output contains a string "No." if you can't exchange O2 to O1, or you should output a line contains "Yes.", and then output your way in exchanging the order(you should output "in" for a train getting into the railway, and "out" for a train getting out of the railway). Print a line contains "FINISH" after each test case. More details in the sample Output.

样例输入

3 123 321 
3 123 312

样例输出

Yes. 
in 
in 
in 
out 
out 
out 
FINISH 
No. 
FINISH

提示

零基础的同学可以先学习基础,教程见:  C语言教程C++教程编译器教程数据结构教程Python教程单片机教程

视频教学见视频网课

标签

通过率

统 计

 提交 533
 正确 159
 格式错误 0
 答案错误 227
 时间超限 7
 内存超限 2
 输出超限 8
 运行错误 69
 编译错误 61