骰子涂色(找规律、打卡)

一、题目

输入两个骰子，判断两者是否等价(输入的顺序为：上、前、左、右、后、下)

二、思路

这种的要么当模拟题，模拟骰子的旋转；或者寻找规律，总结出旋转的结果，从而写出尽量简洁的代码

取上面为参考面，有6种情况，每种情况可水平旋转得4种情况，共24种

三、代码

#include<stdio.h>
#include<iostream>
#include<string.h>
using namespace std;
int base[7][7] = { {0,1,2,3,4,5} ,{1,5,2,3,0,4},{4,0,2,3,5,1},{5,4,2,3,1,0},{3,1,0,5,4,2},{2,1,5,0,4,3} };
char str[20], str1[10], str2[10],str3[10];

int main()
{
    while (scanf("%s",str) == 1)
    {
        int flag = 0;
        for (int i = 0; i < 12; i++)
        {
            if (i < 6)
                str1[i] = str[i];
            else
                str2[i % 6] = str[i];
        }
        
        str2[6] = '';
        for (int i = 0; i < 6; i++)
        {
            for (int j = 0; j < 6; j++)
                str3[j] = str1[base[i][j]];
            str3[6] = '';
            for (int k = 0; k < 4; k++)
            {
                char ch = str3[1];
                str3[1] = str3[2];
                str3[2] = str3[4];
                str3[4] = str3[3];
                str3[3] = ch;
                if (strcmp(str3, str2) == 0)
                {
                    flag = 1;
                    break;
                }
            }
            if (flag)  break;
        }
        if (flag)
            printf("TRUE
");
        else
            printf("FALSE
");
    }
    return 0;
}