Zipper 1.21

Zipper | JXNUOJ

描述：

Given three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitrarily, but each must stay in its original order.

For example, consider forming "tcraete" from "cat" and "tree":

String A: cat
String B: tree
String C: tcraete

As you can see, we can form the third string by alternating characters from the two strings. As a second example, consider forming "catrtee" from "cat" and "tree":

String A: cat
String B: tree
String C: catrtee

Finally, notice that it is impossible to form "cttaree" from "cat" and "tree".

输入：

The first line of input contains a single positive integer from 1 through 1000. It represents the number of data sets to follow. The processing for each data set is identical. The data sets appear on the following lines, one data set per line.

For each data set, the line of input consists of three strings, separated by a single space. All strings are composed of upper and lower case letters only. The length of the third string is always the sum of the lengths of the first two strings. The first two strings will have lengths between 1 and 200 characters, inclusive.

输出：

For each data set, print:

Data set n: yes

if the third string can be formed from the first two, or

Data set n: no

if it cannot. Of course n should be replaced by the data set number. See the sample output below for an example.

样例输入：

3
cat tree tcraete
cat tree catrtee
cat tree cttaree

样例输出：

Data set 1: yes
Data set 2: yes
Data set 3: no

给出三个字符串，你需要确定第三个字符串是否由第一、二个字符串的字母结合而成，第一二个字符串可以被任意的打乱组合。但是每一个字符串的字母顺序不变。

例如    字符串"tcraete" 是由 "cat" 和 "tree"组成

字符串 A: cat
字符串 B: tree
字符串 C: tcraete

如你所见, 第三个字符串是由前两个字符串的字母交替而成.

第二个例子, 字符串 "catrtee" 是由"cat" 和 "tree"组成:

字符串 A: cat
字符串 B: tree
字符串 C: catrtee

最后, 注意到字符串"cttaree" 不可能由 "cat" 和"tree"组成.

输入：

第一行输入一个正整数（1，1000）. 它表示下面测试数据的数量. 每个测试数据的处理是相同的. 

第二行开始为测试数据，每组测试数据占一行。

对于每组测试数据, 由三个字符串组成, 以一个空格隔开. 所有的字符串都只由大小字母组成. 第三个字符串的长度为前两个字符串长度之和。第一二个字符串的长度为1到200之间。

输出：

对于每组测试数据，

如果第三个字符串可以由第一二个字符串组成

输出如下：

Data set n: yes

否则，（当然，每组测试数据个数需要取代n）输出：

Data set n: no