題目連結：

倒置找子串

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
using namespace std;
int main()
{
    string str1,str2,str3,str4;
    while(cin>>str1)
    {
        cin>>str2;
        reverse(str2.begin(),str2.end());
        string s=str1+str2;
        int len1=s.size();
        string ss="";
        for(int i=0;i<len1;i++)
        {
            if(s[i]!='X')
              ss+=s[i];
        }
        cin>>str3>>str4;
        reverse(str4.begin(),str4.end());
        string s1=str3+str4+str3+str4;
        int len2=s1.size();
        string ss1="";
        for(int i=0;i<len2;i++)
        {
            if(s1[i]!='X')
              ss1+=s1[i];
        }
        if(ss1.find(ss)!=string::npos)
        {
            printf("YES\n");
        }
        else
            printf("NO\n");
    }
    return 0;
}