额,这题应该是枚举,一开始想的总不是很好,窝的确是一直连枚举都不会的渣渣
做法非原创,把每个面作为最上面的面,这样就能确定上下两个面了,一共是6种,然后每种里,竖立的这四个面可以旋转四次,所以一共是6*4=24种情况,依次枚举即可。
代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
char s[16], s1[8], s2[8];
int up[6] = { 1, 5, 2, 3, 0, 4 };
int l[6] = { 0, 3, 1, 4, 2, 5 };
void rotate(int t[6], char s[8])
{
char tmp[8];
strcpy(tmp, s);
for (int i = 0; i < 6; ++i)
s[i] = tmp[t[i]];
}
bool check()
{
char tmp[8] = { '\0' };
for (int i = 0; i < 6; ++i)
{
strcpy(tmp, s1);
if (i == 1)
{
rotate(up, tmp);
}
else if (i == 2)
{
rotate(l, tmp); rotate(l, tmp); rotate(l, tmp); rotate(up, tmp);
}
else if (i==3)
{
rotate(l, tmp); rotate(up, tmp);
}
else if (i==4)
{
rotate(l, tmp); rotate(l, tmp); rotate(up, tmp);
}
else if (i == 5)
{
rotate(up, tmp); rotate(up, tmp);
}
for (int j = 0; j < 4; ++j)
{
rotate(l, tmp);
if (strcmp(tmp, s2) == 0)
return true;
}
}
return false;
}
int main()
{
//freopen("input.txt", "r", stdin);
while (scanf("%s", s) != EOF)
{
memset(s1, 0, sizeof(s1));
memset(s2, 0, sizeof(s2));
for (int i = 0; i < 6; ++i)
{
s1[i] = s[i];
s2[i] = s[i + 6];
}
if (check())
printf("TRUE\n");
else
printf("FALSE\n");
}
//system("pause");
//while (1);
return 0;
}