UVA 253(p97)----Cube painting
来源:互联网 发布:企业管理优化建议 编辑:程序博客网 时间:2024/05/20 16:42
#include<cstdio>#include<cstring>#include<iostream>using namespace std;char s[12];int check(char up,char down,char fr,char be,char left,char right){ if ((up==s[6])&&(down==s[11])&&(fr==s[7])&&(be==s[8])&&(left==s[9])&&(right==s[10])) return 1; if ((up==s[6])&&(down==s[11])&&(left==s[7])&&(fr==s[8])&&(right==s[9])&&(be==s[10])) return 1; if ((up==s[6])&&(down==s[11])&&(right==s[7])&&(left==s[8])&&(be==s[9])&&(fr==s[10])) return 1; if ((up==s[6])&&(down==s[11])&&(be==s[7])&&(right==s[8])&&(fr==s[9])&&(left==s[10])) return 1; return 0;}int main(){ int d1,d2,d3,d4,d5,d6; while (scanf("%s",&s)!=EOF) { d1=check(s[0],s[5],s[1],s[2],s[3],s[4]); d2=check(s[1],s[4],s[2],s[0],s[5],s[3]); d3=check(s[2],s[3],s[1],s[5],s[0],s[4]); d4=check(s[5],s[0],s[1],s[3],s[2],s[4]); d5=check(s[4],s[1],s[3],s[0],s[5],s[2]); d6=check(s[3],s[2],s[1],s[0],s[5],s[4]); if (d1+d2+d3+d4+d5+d6) printf("TRUE\n"); else printf("FALSE\n"); } return 0;}题目地址:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=4&page=show_problem&problem=189
0 0
- UVA 253(p97)----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
- UVA 253 Cube painting
- 253 - Cube painting UVA
- UVa 253 Cube painting
- UVA-253-Cube painting
- UVa 253 - Cube painting
- Spring Aop 表达式匹配
- UVA 247(p365)----Calling Circles
- leetcode随笔II
- Objective-C Runtime
- Java游戏服务端编程心得
- UVA 253(p97)----Cube painting
- 第一行代码-9.3 服务的基本用法
- 简单排序方法
- 如何将eclipse项目和svn关联(从服务器取项目)
- leetcode-81-Search in Rotated Sorted Array II
- 简单递归
- [Lintcode]Reverse Words in a String
- UVA 294(p344)----Divisors
- 喊啥--历史记录