旋转游戏

// by BNU_LZM
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int line[8][8] = 
{
	{0, 2, 6, 11, 15, 20, 22};
	{1, 3, 8, 12, 17, 21, 23};
	{10, 9, 8, 7, 6, 5, 4};
	{19, 18, 17, 16, 15, 14, 13};
};
int rev[] = {5, 4, 7, 6, 1, 0, 3, 2};
int cen[] = {6, 7, 8, 11, 12, 15, 16, 17};
int a[30];
char ans[1000];

bool check()
{
	for(int i = 1; i < 8; i++)
		if(a[cen[i]] != a[cen[0]]) return false;
	return true;
}

int h()
{
	int a = 0, b = 0, c = 0;
	for(int i = 0; i < 8; i++) 
	{
		if(a[cen[i]] != 1) a++;
		if(a[cen[i]] != 2) b++;
		if(a[cen[i]] != 3) c++;
	}
	return min(min(a, b), c);
}

void move(int i)
{
	int tmp = a[line[i][0]];
	for(int j = 0; j < 6; j++) a[line[i][j]] = a[line[i][j+1]];
	a[line[i][6]] = tmp;
}

bool dfs(int d, int maxd)
{
	if(check()) 
	{
		ans[d] = '\0';
		printf("%s\n", ans);
		return true;
	}
	if(d == maxd) return false;
	if(maxd-d < h()) return false;
	for(int i = 0; i < 8; i++)
	{
		ans[d] = 'A'+i;
		move(i);
		if(dfs(d+1, maxd)) return true;
		move(rev[i]);
	}
	return false;
}

int solve()
{
	if(check()) return 0;
	for(int maxd = 1; ; maxd++)
	{
		if(dfs(0, maxd)) return maxd;
	}
}

int main()
{
	for(int i = 4; i < 8; i++) 
		for(int j = 0; j < 7; j++)
			line[i][j] = line[rev[i]][6-j];
	for(int i = 0; i < 24; i++) scanf("%d", &a[i]);
	printf("%d\n", solve());
	return 0;
}