寒假翻译题训练 2月14号

链接：https://acs.jxnu.edu.cn/problem/HDU1022

题目：

描述：

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 all over 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 an order 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.

翻译如下

描述：

新学期来了，Ignatius火车站现在非常繁忙。很多学生都想坐火车回学校(因为Ignatius火车站的火车是世界上最快的火车^v^)。但问题来了，只有一条铁路可供火车停放。所以所有的火车都只能从一边进出火车站。对于这个问题，如果A火车先进入铁路，而B火车在A火车离开前进入铁路，那么A火车只有在B火车离开后离开。具体流程如下图所示。现在问题是，这个车站最多能同时停放9列火车，所有火车都有一个ID(从1到n)，火车按照O1的顺序进入铁路，你的任务是确定火车能否按照O2的顺序出站。

 

输入：

输入包含多组样例。每组样例包含一个整数，表示火车的数量，两个字符串，分别表示火车进入的顺序:O1，火车离开的顺序:O2。文件结束时输入终止。具体细节可参考输入样例。

输出：

如果不能交换O2到O1则输出"No."，反之输出“Yes.”，然后输出交换顺序(输出“in”表示火车进入铁路，输出“out”表示火车离开铁路)。在每个样例后面输出“FINISH”的行。具体细节可参考示例输出。