To the S, T two strings, you can choose to add an unlimited number of S in a string of characters behind a character, but with the addition of this character can not choose the same character, ask S series can become T string. Ideas: After observed that if S and T as the length of the direct negotiations. If you do not like it, as long as 1, the order of all the characters inside S appear in the T series in over 2, the front part of the same character in front of T and S can match Here two conditions can be constituted.

cc.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．