填寫問券˙抽7-11禮券來自星星的你也會打廣告?輕忽小中風,當心變殘障晚會結束續攤大腸花 學...
2012-09-15 10:00:06 人氣(299) | 回應(0) | 推薦(0) | 收藏(0) 上一篇 | 下一篇

[UVA][骰子翻轉比對] 253 - Cube painting

0
收藏
0
推薦

 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.

picture21

Figure 1.

Since a cube has 6 faces, our machine can paint a face-numbered cube in tex2html_wrap_inline126 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 tex2html_wrap_inline128 character ( tex2html_wrap_inline130 ) 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 tex2html_wrap_inline134 , 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 <stdio.h>
#include <string.h>
typedef struct {
char p[6];
} Dice;
int cmp(Dice x, Dice y) {
static int i;
for(i = 0; i < 6; i++)
if(x.p[i] != y.p[i])
return x.p[i] - y.p[i];
return 0;
}
Dice MinExp(Dice x) {
Dice y = x;
int i, j, t;
for(i = 0; i < 4; i++) { /*x_rotate*/
for(j = 0; j < 4; j++) { /*y_rotate*/
t = x.p[2], x.p[2] = x.p[0], x.p[0] = x.p[3];
x.p[3] = x.p[5], x.p[5] = t;
if(cmp(y, x) > 0) y = x;
}
for(j = 0; j < 4; j++) { /*z_rotate*/
t = x.p[0], x.p[0] = x.p[1], x.p[1] = x.p[5];
x.p[5] = x.p[4], x.p[4] = t;
if(cmp(y, x) > 0) y = x;
}
t = x.p[1], x.p[1] = x.p[3], x.p[3] = x.p[4];
x.p[4] = x.p[2], x.p[2] = t;
if(cmp(y, x) > 0) y = x;
}
return y;
}
int main() {
char s[50], i;
Dice a, b;
while(gets(s)) {
for(i = 0; i < 6; i++)
a.p[i] = s[i], b.p[i] = s[i+6];
a = MinExp(a);
b = MinExp(b);
if(!memcmp(a.p, b.p, 6))
puts("TRUE");
else
puts("FALSE");
}
return 0;
}

253Cube painting骰子比對骰子翻轉
台長:Morris
人氣(299) | 回應(0)| 推薦 (0)| 收藏 (0)| 轉寄
全站分類: 不分類 | 個人分類: UVA |
此分類下一篇:[UVA][編碼檢查、Trie] 644 - Immediate Decodability
此分類上一篇:[UVA][模擬] 10142 - Australian Voting

我要回應
是 (若未登入"個人新聞台帳號"則看不到回覆唷!)
* 請輸入識別碼:
請輸入以下數字 (ex:123)

(有*為必填)
詳全文