UVA 253 - Cube painting（立方体涂色）

最新推荐文章于 2021-01-26 21:21:06 发布

原创最新推荐文章于 2021-01-26 21:21:06 发布 · 1.1k 阅读

0 ·

CC 4.0 BY-SA版权

UVA 同时被 2 个专栏收录

41 篇文章

订阅专栏

数学题

14 篇文章

订阅专栏

本文介绍了一个编程问题，即通过比较两个六面体的颜色配置来判断它们是否可以通过旋转相互转换。文章提供了完整的代码实现，利用字符串操作来简化比较过程。

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.

tex2html_wrap138 tex2html_wrap140

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

===================================

题意：前六个字符是第一个立方体，后六个字符是第二个立方体，问能否通过旋转第一个立方体得到第二个立方体

只要三个对面颜色互相匹配就一定可以得到

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

char str[20];

int main()
{
    while(gets(str))
    {
        int ans=1;
        for(int i=0;i<3;i++)
        {
            int flag=0;
            for(int j=6;j<12;j++)
            {
                if(str[i]==str[j]&&str[5-i]==str[17-j])
                {
                    flag=1;
                    str[j]=' ';
                    str[17-j]=' ';
                    break;
                }
            }
            if(!flag)
            {
                ans=0;
                break;
            }
        }
        if(ans) printf("TRUE\n");
        else printf("FALSE\n");
    }
    return 0;
}