UVA 253 Cube painting（思维题）
2015-08-27 11:05
676 查看
题意：略
解题思路：所有可能全部枚举， 我估计我是解这个题，方法最笨，代码量最长的人，就别参考了，尽情的笑话我吧。
最下面有神方法， 枚举三次此面，和对立面即可。代码简单易懂。
Description
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.
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.)
解题思路：所有可能全部枚举， 我估计我是解这个题，方法最笨，代码量最长的人，就别参考了，尽情的笑话我吧。
最下面有神方法， 枚举三次此面，和对立面即可。代码简单易懂。
Description
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.
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
| Memory: 0 KB | Time: 0 MS | |
| Language: C++ 4.8.2 | Result: Accepted |
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cctype>
#include<list>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
using namespace std;
#define MAX_N 20
const int INF = 0x3f3f3f3f;
char s[MAX_N], str1[MAX_N], str2[MAX_N], s1[MAX_N], s2[MAX_N];
void separate()
{
for(int i = 0 ; i < 6 ; i++)
{
s1[i] = s[i];
s2[i] = s[i + 6];
}
}
bool change_right(char str1[], char str2[])
{
char tmp = str2[3];
str2[3] = str2[1];
str2[1] = str2[2];
str2[2] = str2[4];
str2[4] = tmp;
if(strcmp(str1, str2)) return false;
else return true;
}
bool change_left(char str1[], char str2[])
{
char tmp = str2[2];
str2[2] = str2[1];
str2[1] = str2[3];
str2[3] = str2[4];
str2[4] = tmp;
if(strcmp(str1, str2)) return false;
else return true;
}
bool change_up(char str1[], char str2[])
{
char tmp = str2[0];
str2[0] = str2[1];
str2[1] = str2[5];
str2[5] = str2[4];
str2[4] = tmp;
if(strcmp(str1, str2)) return false;
else return true;
}
bool change_down(char str1[], char str2[])
{
char tmp = str2[5];
str2[5] = str2[1];
str2[1] = str2[0];
str2[0] = str2[4];
str2[4] = tmp;
if(strcmp(str1, str2)) return false;
else return true;
}
bool change_top_left(char str1[], char str2[])
{
char tmp = str2[2];
str2[2] = str2[0];
str2[0] = str2[3];
str2[3] = str2[5];
str2[5] = tmp;
if(strcmp(str1, str2)) return false;
else return true;
}
bool change_top_right(char str1[], char str2[])
{
char tmp = str2[3];
str2[3] = str2[0];
str2[0] = str2[2];
str2[2] = str2[5];
str2[5] = tmp;
if(strcmp(str1, str2)) return false;
else return true;
}
bool change_front(char str1[], char str2[])
{
char tmp1 = str2[4];
str2[4] = str2[1];
str2[1] = tmp1;
char tmp2 = str2[2];
str2[2] = str2[3];
str2[3] = tmp2;
if(strcmp(str1, str2)) return false;
else return true;
}
bool change_top(char str1[], char str2[])
{
char tmp1 = str2[5];
str2[5] = str2[0];
str2[0] = tmp1;
char tmp2 = str2[4];
str2[4] = str2[1];
str2[1] = tmp2;
if(strcmp(str1, str2)) return false;
else return true;
}
int main()
{
// freopen("253.txt", "w", stdout);
// freopen("out.txt", "r", stdin);
while(scanf("%s", s) != EOF)
{
separate();
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top(str1, str2))//1
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_front(str1, str2))//1
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_right(str1, str2))//1
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_left(str1, str2))//2
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_up(str1, str2))//3
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_down(str1, str2))//4
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top_left(str1, str2))//5
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top_right(str1, str2))//6
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_up(str1, str2)|| change_left(str1, str2))//7
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_left(str1, str2)|| change_up(str1, str2))//8
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_up(str1, str2)|| change_right(str1, str2))//9
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_right(str1, str2)|| change_up(str1, str2))//10
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_down(str1, str2)|| change_right(str1, str2))//11
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_right(str1, str2)|| change_down(str1, str2))//12
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_down(str1, str2)|| change_left(str1, str2))//13
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_left(str1, str2)|| change_down(str1, str2))//14
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top_left(str1, str2)|| change_left(str1, str2))//15
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_left(str1, str2)|| change_top_left(str1, str2))//16
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top_left(str1, str2)|| change_right(str1, str2))//17
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_right(str1, str2)|| change_top_left(str1, str2))//18
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top_right(str1, str2)|| change_up(str1, str2))//19
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_up(str1, str2)|| change_top_right(str1, str2))//20
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top_right(str1, str2)|| change_down(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_down(str1, str2)|| change_top_right(str1, str2))//22
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_up(str1, str2)|| change_top_left(str1, str2))
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top_left(str1, str2)|| change_up(str1, str2))
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top_left(str1, str2)|| change_down(str1, str2))
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_down(str1, str2)|| change_top_left(str1, str2))
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top_right(str1, str2)|| change_left(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_left(str1, str2)|| change_top_right(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_right(str1, str2)|| change_top_right(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top_right(str1, str2)|| change_right(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top(str1, str2)|| change_right(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_right(str1, str2)|| change_top(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_left(str1, str2)|| change_top(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top(str1, str2)|| change_left(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_front(str1, str2)|| change_left(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_left(str1, str2)|| change_front(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_right(str1, str2)|| change_front(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_front(str1, str2)|| change_right(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_front(str1, str2)|| change_top(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top(str1, str2)|| change_front(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top(str1, str2)|| change_top_left(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top_left(str1, str2)|| change_top(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top(str1, str2)|| change_top_right(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top_right(str1, str2)|| change_top(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_front(str1, str2)|| change_top_right(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top_right(str1, str2)|| change_front(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_front(str1, str2)|| change_top_left(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_top_left(str1, str2)|| change_front(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_up(str1, str2)|| change_front(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_front(str1, str2)|| change_up(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_down(str1, str2)|| change_front(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
strcpy(str1, s1);
strcpy(str2, s2);
if(change_front(str1, str2)|| change_down(str1, str2))//21
{
cout<<"TRUE"<<endl;
continue;
}
cout<<"FALSE"<<endl;
}
return 0;
}| Memory: 0 KB | Time: 0 MS | |
| Language: C++ 4.8.2 | Result: Accepted |
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cctype>
#include<list>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
using namespace std;
/**************************************************************/
#define MAX_N 20
const int INF = 0x3f3f3f3f;
char s[MAX_N], s1[MAX_N], s2[MAX_N];
void separate()
{
for(int i = 0 ; i < 6 ; i++)
{
s1[i] = s[i];
s2[i] = s[i + 6];
}
}
int main()
{
while(~scanf("%s", s))
{
separate();
int ans = 1;
for(int i = 0 ; i < 3 ; i++)
{
int flag = 0;
for(int j = 0 ; j < 6 ; j++)
{
if(s1[i] == s2[j] && s1[5 - i] == s2[5 - j])
{
flag = 1;
s2[j] = 'o';
s2[5 - j] = 'o';
break;
}
}
if(!flag)
{
ans = 0;
break;
}
}
if(ans) cout<<"TRUE"<<endl;
else cout<<"FALSE"<<endl;
}
return 0;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- usaco Barn Repair
- strong，weak, retain， assign的区别
- timed out waiting for input: auto-logout
- ubuntu下出现su: Authentication failture
- 2015 Multi-University Training Contest 9（hdu 5396 - hdu 5405）
- AIDL的简单示例与解析
- hdoj 1023 Train Problem II 【卡特兰数】
- RAID各级别的特性
- MainActivity 嵌入 Fragment 的每个函数执行的生命周期
- hdoj.1023 Train Problem II【卡特兰数列】 2015/08/27
- 2015.6.17（Tair）
- oc assign / copy / retain / 容器 / 多态
- oc MRC内存管理机制alloc/retain/copy/release/autorelease
- Syntax error, type annotations are available only when source level is at least 1.8
- install ftp client on kail
- Container With Most Water
- LightOJ 1403 - Air Raid【二分匹配】
- Leetcode: Contains Duplicate
- Leetcode: Factorial Trailing Zeroes
- ideaiu的使用