UVa 253 Cube painting（骰子涂色）

Description

Cube painting

We have a machine for painting cubes. It is supplied with three different colors: blue, red and green. Each face of the cube gets one of these colors. The cube's faces are numbered as in Figure 1.

Figure 1.

Since a cube has 6 faces, our machine can paint a face-numbered cube in  different ways. When ignoring the face-numbers, the number of different paintings is much less, because a cube can be rotated. See example below. We denote a painted cube by a string of 6 characters, where each character is a b, r, or g. The  character (  ) from the left gives the color of face i. For example, Figure 2 is a picture of rbgggr and Figure 3 corresponds to rggbgr. Notice that both cubes are painted in the same way: by rotating it around the vertical axis by 90  , the one changes into the other.

Input

The input of your program is a textfile that ends with the standard end-of-file marker. Each line is a string of 12 characters. The first 6 characters of this string are the representation of a painted cube, the remaining 6 characters give you the representation of another cube. Your program determines whether these two cubes are painted in the same way, that is, whether by any combination of rotations one can be turned into the other. (Reflections are not allowed.)

Output

The output is a file of boolean. For each line of input, output contains TRUE if the second half can be obtained from the first half by rotation as describes above, FALSE otherwise.

Sample Input

rbgggrrggbgr
rrrbbbrrbbbr
rbgrbgrrrrrg

Sample Output

TRUE
FALSE
FALSE

这题比较简单，就是一个模拟匹配的过程，根据题目给的颜色顺序一一匹配，用一组标记变量记录对应面（正方体有三对面）是否匹配过，依次枚举，匹配数为3的时候即证明两骰子等价（其实逻辑很简单就是想起来比较抽象，我是用一个魔方转过来转过去才想清楚的。。。。），代码如下：

#include <iostream>
#include <cstring>

using namespace std;

int main()
{
	ios::sync_with_stdio(false);
	char c1[15],c2[15];	//存两个骰子各面的颜色
	while(cin>>c1)
	{
		bool mark[3]={0};	//存储对应面是否已经匹配
		int cont=0;	//统计匹配对数
		strcpy(c2,c1+6);	//将字符串分割
		c1[6]=0;
		for(int i=0;i<3;i++)
			for(int j=0;j<3;j++)
				if((!mark[j])&&((c1[i]==c2[j]&&c1[5-i]==c2[5-j])||(c1[i]==c2[5-j]&&c1[5-i]==c2[j])))	//未匹配且题述面对应相等则匹配数累加1
				{
					mark[j]=true;
					cont++;
					break;
				}
		cout<<(cont==3?"TRUE":"FALSE")<<endl;	//如果3对匹配才是完全等价
	}

	return 0;
}