UVa 253

UVa 253

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <sstream>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <iomanip>
#include <stack>

using namespace std;

typedef long long LL;
const int INF = 0x3f3f3f3f;
const int MAXN = 100005;
const int MOD = 1e9 + 7;

#define MemI(x) memset(x, -1, sizeof(x))
#define Mem0(x) memset(x, 0, sizeof(x))
#define MemM(x) memset(x, 0x3f, sizeof(x))

//把骰子的每一个面都放在第一面，有 6 种可能，然后第一面不变，中间四个面旋转
int dis[7][7] = {{0, 1, 2, 3, 4, 5}, {1, 5, 2, 3, 0, 4}, {2, 0, 1, 4, 5, 3}, {3, 1, 0, 5, 4, 2}, {4, 0, 2, 3, 5, 1}, {5, 4, 2, 3, 1, 0}};
int main()
{
    string s;
    while(cin >> s)
    {
        string a, b;
        int i, j;
        for(i = 0;i < 6;++i)
            a += s[i];
        for(i = 6;i < 12;++i)
            b += s[i];
        a[6] = b[6] = 0;//分开两种面的情况
        int flag = 0;
        for(i = 0;i < 6 && !flag;++i)
        {
            string t;
            for(j = 0;j < 6;++j)
                t += a[dis[i][j]];
            t[6] = 0;
            if(t == b)
                flag = 1;
            //旋转中间四个面，可以发现 1 面是从 3 面转来的 (编号从 0 开始）,以此类推
            for(j = 0;j < 3 && !flag;++j)
            {
                char p = t[1];
                t[1] = t[3];
                t[3] = t[4];
                t[4] = t[2];
                t[2] = p;
                if(t == b)
                    flag = 1;
            }
        }
        if(flag)
            cout << "TRUE" << endl;
        else
            cout << "FALSE" << endl;
    }
    return 0;
}