| 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 最简单的方法，穷举
1 #include <iostream>
2 using namespace std;
3 char s[13];
4
5 //判断五个面即可(剩下一个确定)
6 int judge(char c1,char c2,char c3,char c4,char c5)
7 { //第一个数的面固定，旋转有四种情况
8 if(c1==s[6]&&c2==s[7]&&c3==s[8]&&c4==s[9]&&c5==s[10])return 1;
9 if(c1==s[6]&&c2==s[9]&&c3==s[7]&&c4==s[10]&&c5==s[8])return 1;
10 if(c1==s[6]&&c2==s[10]&&c3==s[9]&&c4==s[8]&&c5==s[7])return 1;
11 if(c1==s[6]&&c2==s[8]&&c3==s[10]&&c4==s[7]&&c5==s[9])return 1;
12 return 0;
13 }
14 int main()
15 {
16 while(cin>>s){
17 int x1,x2,x3,x4,x5,x6;
18 x1=judge(s[0],s[1],s[2],s[3],s[4]); //各个不同的面放在第一个数
19 x2=judge(s[1],s[5],s[2],s[3],s[0]);
20 x3=judge(s[2],s[4],s[0],s[5],s[1]);
21 x4=judge(s[3],s[1],s[0],s[5],s[4]);
22 x5=judge(s[4],s[0],s[2],s[3],s[5]);
23 x6=judge(s[5],s[4],s[2],s[3],s[1]);
24 if(x1+x2+x3+x4+x5+x6)cout<<"TRUE"<<endl;
25 else cout<<"FALSE"<<endl;
26 }
27 return 0;
28 }