题意：给你一个2X2的华容道你，问能不能通过初始给出的棋盘然后变换到最后的棋盘
思路：由于是一个2X2的...所以怎么做都可以..留意到每个棋子的移动其实都是顺时针或者逆时针的就好做了。
#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
using namespace std;
#define maxn 100000
#define LL long long
int cas=1,T;
int main()
{
string a,b,c,d;
while(cin >> a)
{
string s1,s2;
cin >> b >>c>>d;
for (int i = 0;i<2;i++)
if (a[i]!='X')
s1+=a[i];
for (int i = 1;i>=0;i--)
if (b[i]!='X')
s1+=b[i];
s1+=s1;
for (int i = 0;i<2;i++)
if (c[i]!='X')
s2+=c[i];
for (int i = 1;i>=0;i--)
if (d[i]!='X')
s2+=d[i];
// cout << s1 <<" " << s2;
if (s1.find(s2)==string::npos)
puts("NO");
else
puts("YES");
}
//freopen("in","r",stdin);
//scanf("%d",&T);
//printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);
return 0;
}
Description
Bessie the cow and her best friend Elsie each received a sliding puzzle on Pi Day. Their puzzles consist of a 2 × 2 grid and three tiles labeled 'A', 'B', and 'C'. The three tiles sit on top of the grid, leaving one grid cell empty. To make a move, Bessie or Elsie can slide a tile adjacent to the empty cell into the empty cell as shown below:
In order to determine if they are truly Best Friends For Life (BFFLs), Bessie and Elsie would like to know if there exists a sequence of moves that takes their puzzles to the same configuration (moves can be performed in both puzzles). Two puzzles are considered to be in the same configuration if each tile is on top of the same grid cell in both puzzles. Since the tiles are labeled with letters, rotations and reflections are not allowed.
Input
The first two lines of the input consist of a 2 × 2 grid describing the initial configuration of Bessie's puzzle. The next two lines contain a2 × 2 grid describing the initial configuration of Elsie's puzzle. The positions of the tiles are labeled 'A', 'B', and 'C', while the empty cell is labeled 'X'. It's guaranteed that both puzzles contain exactly one tile with each letter and exactly one empty position.
Output
Output "YES"(without quotes) if the puzzles can reach the same configuration (and Bessie and Elsie are truly BFFLs). Otherwise, print "NO" (without quotes).
Sample Input
Input
AB XC XB AC
Output
YES
Input
AB XC AC BX
Output
NO
