B. Reverse String（CodeForces div.1 + div.2）

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
inputCopy
6
abcdef
cdedcb
aaa
aaaaa
aab
baaa
ab
b
abcdef
abcdef
ba
baa
outputCopy
YES
YES
NO
YES
YES
NO
Note
Consider the examples.

The first test case is described in the statement.

In the second test case, you can place the chip on the 1-st position, move it twice to the right, and then move it twice to the left.

In the fourth test case, you can place the chip on the 2-nd position, and then don’t move it at all.

In the fifth test case, you can place the chip on the 1-st position, move it 5 times to the right, and then finish the process.

题意

例如：
对于字符串 abcdef 到 cdedcb，可以使
芯片放在第3位得 c
芯片右移1位 得 d
再右移一位 得 e
再左移一位 得 d… …
注意：芯片右移过程中可以向左移，但向左移动时不能向右移。

代码如下：

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string.h>
#include <string>
#include <queue>
#include <vector>
#include <utility>//pair
#include <cmath>
#include <limits.h>//INT_MAX  INT_MIN
#include <cstring>
typedef long long ll;
using namespace std;
const int N = 1e5+10;

char c1[1000],c2[1000];
bool flag,ju;
void dfs(int i,int t,int gui){//gui==1 表示向右移
    if(flag)
        return;

    if(c2[t]==0){//已经得出目标字符串 输出 Yes
        flag = true;
        return ;
    }
    if(c1[i]==0||c1[i]!=c2[t]){
        return;
    }

    if(gui)
        dfs(i+1,t+1,1);

    if(flag) return;

    dfs(i-1,t+1,0);
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--){
        scanf("%s",c1);
        scanf("%s",c2);
        flag = false;
        ju=false;
        for(int i=0;c1[i]!=0;i++){
            dfs(i,0,1);
            if(flag) break;
        }
        if(flag)
            printf("Yes\n");
        else
            printf("No\n");
    }
    return 0;
}