UVa253 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. Since a cube has 6 faces, our machine can paint a face-numbered cube in 3⁶ = 729 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 i-th character (1 ≤ i ≤ 6) 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.

1.emmmmm刚看到这题以为很难，但是想了想也就是判断每个对面是否相等（为此还参考了魔方hhhh有点der）

2.废话少说上代码（注释详细）：

#include <iostream>
#include <cstring>
using namespace std;
char c1[7],c2[7];
int num1[3],num2[3];//判断每个正方体的每种颜色个数
int jud[3]; //判断第一个正方体三个对面是否都能和第二个一一对应
bool judge1(){ //判断是不是有不同个数的颜色，那么一定为false
    int flag=1;
    for(int i=0;i<3;i++)
    if(num1[i]!=num2[i]){
        flag=0;
        break;
    }
    if(flag) return true;
    else return false;
}
bool judge2(){
    char s1,s2;
    //循环遍历比较对面，最多比较九次，每比较出结果就将对应jud[1,(2),(3)]设置为1
    for(int i=1;i<=3;i++){
        s1=c1[i];
        s2=c1[7-i];
        for(int j=1;j<=3;j++){
            //判断是否已经和其他对面配对（因为这个WA了两次）
            if(jud[j-1]) continue;
            if((c2[j]==s1&&c2[7-j]==s2)||(c2[j]==s2&&c2[7-j]==s1)){
                //cout<<jud[j-1];
                jud[j-1]=1;
                //cout<<j<<endl;
                break;
            }
        }
    }
    int sum=0;
    for(int i=0;i<3;i++)
        sum+=jud[i];
    if(sum==3) return true;
    else return false;
}
int main()
{
    char c;
    while(cin>>c){
        //全局变量数组多文件输入一定要注意清空，且注意memset的用法
        memset(num1,0,sizeof(num1));
        memset(num2,0,sizeof(num2));
        memset(jud,0,sizeof(jud));
        if(c=='r') num1[0]++;
        else if(c=='g') num1[1]++;
        else if(c=='b') num1[2]++;
        c1[1]=c;
        for(int i=2;i<=6;i++){
            cin>>c;
            c1[i]=c;
            if(c=='r') num1[0]++;
            else if(c=='g') num1[1]++;
            else if(c=='b') num1[2]++;
        }
        for(int i=1;i<=6;i++){
            cin>>c;
            c2[i]=c;
            if(c=='r') num2[0]++;
            else if(c=='g') num2[1]++;
            else if(c=='b') num2[2]++;
        }
        if(!judge1()){
            printf("FALSE\n");
            continue;
        }

        if(judge2()) printf("TRUE\n");
        else printf("FALSE\n");
    }
    return 0;
}