刘汝佳《算法竞赛入门经典(第二版)》第四章习题(4-4~4-6)
习题4-4 骰子涂色(Cube painting,UVa253)
输入两个骰子,判断两者是否等价。每个骰子用6个字母表示。
例如rbgggr和rggbgr是等价的。
原题描述:
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 , t
he 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对应6,2对应5),因此只要将骰子的三组对应面进行比较,若相同即可判断出是同一骰子。
源代码
#include <iostream>
#include <string>
int main (void)
{
using std::cout;
using std::cin;