[Login|Register]
Problems

Status

Rank

Problem 1324
Zipper
Time Limit: 1000ms
Memory Limit: 65536kb
Description
Given three strings, you are to determine whether the third string can be formed by combining the letters 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".
Input
The first line of input file contains a single positive integer n(1 <= n <= 1000). It represents the number of data sets to follow. Each line represents a data set. 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 450, inclusive.
Output
For each data set, if the third string can be formed from the first two, print:
Data set i: yes
or if it cannot, print:
Data set i: no
Of course i should be replaced by the data set number. See the sample output below for an example.
Sample Input
3
cat tree tcraete
cat tree catrtee
cat tree cttaree
Sample Output
Data set 1: yes
Data set 2: yes
Data set 3: no
Hint
不能通过的同学,请将数组1、2开到450以上,数组3开到900以上试一下。
University of Science and Technology of China
Online Judge for ACM/ICPC
Processed in 0.6ms with 1 query(s).