Harbour.Space Scholarship Contest 2021-2022 (rated, Div. 1 + Div. 2)B. Reverse String

B. Reverse String

time limit per test3 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output

You have a string s and a chip, which you can place onto any character of this string.

After placing the chip, you move it to the right several (maybe zero) times, i. e. you perform the following operation several times: if the current position of the chip is i, you move it to the position i+1. Of course, moving the chip to the right is impossible if it is already in the last position.

After moving the chip to the right, you move it to the left several (maybe zero) times, i. e. you perform the following operation several times: if the current position of the chip is i, you move it to the position i−1. Of course, moving the chip to the left is impossible if it is already in the first position.

When you place a chip or move it, you write down the character where the chip ends up after your action. For example, if s is abcdef, you place the chip onto the 3-rd character, move it to the right 2 times and then move it to the left 3 times, you write down the string cdedcb.

You are given two strings s and t. Your task is to determine whether it’s possible to perform the described operations with s so that you write down the string t as a result.

Input
The first line contains one integer q (1≤q≤500) — the number of test cases.

Each test case consists of two lines. The first line contains the string s (1≤|s|≤500), the second line contains the string t (1≤|t|≤2⋅|s|−1). Both strings consist of lowercase English characters.

It is guaranteed that the sum of |s| over all test cases does not exceed 500.

Output
For each test case, print “YES” if you can obtain the string t by performing the process mentioned in the statement with the string s, or “NO” if you cannot.

You may print each letter in any case (YES, yes, Yes will all be recognized as positive answer, NO, no and nO will all be recognized as negative answer).
Example
Input
6
abcdef
cdedcb
aaa
aaaaa
aab
baaa
ab
b
abcdef
abcdef
ba
baa

Output
YES
YES
NO
YES
YES
NO

题意
有字符串s，在s某个位置做标记，标记先右移再左移，左移后不可再右移，记录标记经过的字符串元素
右移时（可以移动0个）如果标记到了i，那么把标记放在i+1，左移时（也可移动0个）就把标记放在i-1。
给定一个s一个t，判断t是不是s经过上述操作后可以记录下来的一串字符串。
做法：暴力，把s所有的组法都给分出来，然后判断t是不是这种组法可以做出来的子串，
//str.substr(pos1,pos2)截取字符串其中一段
//reverse(str.pos1,str.pos2)反转字符串
//if (res.find(t) != res.npos)判断t是不是res的一个字串

#include <bits/stdc++.h>
 
using namespace std;
 
int T,n;
 
string s,t;
 
int main()
{
	cin >> T;
	while (T--)
	{
		string s,t;
		cin >> s >> t;
		bool ok = 0;
		for (int i = 0;i < s.size();i++)
		{
			string res = s.substr(0,i + 1),a = s.substr(0,i);
			reverse(a.begin(),a.end());
			cout<<res<<" "<<a<<endl;
			res += a;
			if (res.find(t) != res.npos)
			{
				ok = 1;
				break;
			}
		}
		puts(ok ? "YES" : "NO");
	}
	return 0;
}