Contents
Problem
中文網址
Solution
利用翻轉骰子來替換最上面的,總共 6 面。每次以不同的面當最上面時,再旋轉四次側面,去比對有沒有一樣的。
Code
UVa 253
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82
|
char str1[6], str2[6]; inline void () { int temp = str2[4]; str2[4] = str2[2]; str2[2] = str2[1]; str2[1] = str2[3]; str2[3] = temp; } inline void forward() { int temp = str2[5]; str2[5] = str2[4]; str2[4] = str2[0]; str2[0] = str2[1]; str2[1] = temp; } inline void turnRight() { int temp = str2[3]; str2[3] = str2[0]; str2[0] = str2[2]; str2[2] = str2[5]; str2[5] = temp; } inline bool cmp() { for (int i = 0; i < 6; i++) if (str1[i] != str2[i]) return false; return true; } int main() { while ((str1[0] = getchar()) != EOF) { int i; for (i = 1; i < 6; i++) str1[i] = getchar(); for (i = 0; i < 6; i++) str2[i] = getchar(); getchar();
bool ok = false;
for (int i = 0; i < 4 && !ok; i++) { for (int j = 0; j < 4; j++) { if (cmp()) { ok = true; break; } clockwise(); } forward(); }
for (int i = 0; i < 4 && !ok; i++) { for (int j = 0; j < 4; j++) { if (cmp()) { ok = true; break; } clockwise(); }
turnRight(); }
puts(ok ? "TRUE" : "FALSE"); }
return 0; }
|
近期评论