UVA - 253 Cube painting
来源:互联网 发布:linux exe 用什么命令 编辑:程序博客网 时间:2024/06/06 02:59
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 ab, r, or g. The character ( ) from the left gives the color of facei. For example, Figure 2 is a picture of rbgggr and Figure 3 corresponds torggbgr. 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.
Sample Input
rbgggrrggbgrrrrbbbrrbbbrrbgrbgrrrrrg
Sample Output
TRUEFALSEFALSE题意:两个六边形,第一个六边形由前6个字符表示,后一个六边形由后6个字符表示。问第一个六边形与第二个六边形是否相同#include<string.h>#include<stdio.h>#include<iostream>#define N 200using namespace std;int main(){char a[N];int b[N][N];int c[N][N];int n = 0;while(scanf("%s",a)!= EOF){memset(b,0,sizeof(b));memset(c,0,sizeof(c));for(int i = 0; i < 3;i ++){b[a[i]][a[5-i]] ++ ;b[a[5-i]][a[i]] ++;}int flag = 0;for(int i = 6 ; i < 9;i ++){c[a[i]][a[17 - i]] ++;c[a[17 - i]][a[i]] ++;}for(int i = 0; i < 3;i ++){if(b[a[i]][a[5-i]] != c[a[i]][a[5-i]]){flag = 1;printf("FALSE\n");break;}}if(!flag)printf("TRUE\n");}return 0;}
- UVa 253 - Cube painting
- Uva 253 - Cube painting
- Uva 253 Cube Painting
- uva 253 Cube painting
- uva 253 - Cube painting
- UVa 253 - Cube painting
- UVA 253 - Cube painting
- UVA 253 - Cube painting
- UVA 253 Cube painting
- UVa 253: Cube painting
- uva 253 - Cube painting
- uva 253 Cube painting
- UVA 253 Cube painting
- 253 - Cube painting UVA
- UVa 253 Cube painting
- UVA-253-Cube painting
- UVa 253 - Cube painting
- UVA 253 Cube painting
- 稀疏数组(Sparse array)
- 非零点之间聚类
- oralce11g 注册表卸载20140810
- 【CodeForces】455D Serega and Fun 双向链表分块暴力
- 编辑器
- UVA - 253 Cube painting
- 【嵌入式Linux】[串口]:串口打印时,文件系统中的中文内容乱码,U盘中文内容乱码
- hdu 1166 敌兵布阵(单点更新及区间求和)
- 【Leetcode长征系列】Symmetric Tree
- java CyclicBarrier使用
- 存专题的新博客
- iOS绘图
- Rail4.1 Asset Pipeline
- LeetCode总结 -- 一维动态规划篇