2019 Subsequence

时间限制 : 2000/1000 MS(Java/Others) | 内存限制 : 131072/65536 KB(Java/Others)

Submits : 1 | Solved : 1

题目描述

Given a string s of length n, a subsequence of it, is defined as another string s' = su1su2...sum where 1 ≤ u1 < u2 < ... < um ≤ n and si is the ith character of s. Your task is to write a program that, given two strings s1 and s2, checks whether either s2 or its reverse is a subsequence of s1 or not.

输入要求

The first line of input contains an integer T, which is the number of test cases. Each of the next T lines contains two non-empty strings s1 and s2 (with length at most 100) consisted of only alpha-numeric characters and separated from each other by a single space.

输出要求

For each test case, your program must output "YES", in a single line, if either s2 or its reverse is a subsequence of s1. Otherwise your program should write "NO".

输入样例

5
arash aah
arash hsr
kick kkc
A a
a12340b b31

输出样例

YES
YES
NO
NO
YES

提示


来源

Amirkabir University of Technology Local Contest 2006

[ 返回顶端 ] | [ 代码提交 ]