uva-253相当恶心暴力的搜索

最新推荐文章于 2024-08-01 09:59:56 发布

可可之梦

最新推荐文章于 2024-08-01 09:59:56 发布

阅读量849

点赞数

分类专栏： uva

本文链接：https://blog.csdn.net/kkzmcute/article/details/17187105

版权

uva 专栏收录该内容

46 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<cstring>
using namespace std;
int ans[24][6]={{1,2,3,4,5,6},{1,3,5,2,4,6},{1,5,4,3,2,6},{1,4,2,5,3,6},
                {2,1,4,3,6,5},{2,3,1,6,4,5},{2,6,3,4,1,5},{2,4,6,1,3,5},
                {3,1,2,5,6,4},{3,2,6,1,5,4},{3,5,1,6,2,4},{3,6,5,2,1,4},
                {4,1,5,2,6,3},{4,2,1,6,5,3},{4,5,6,1,2,3},{4,6,2,5,1,3},
                {5,1,3,4,6,2},{5,3,6,1,4,2},{5,4,1,6,3,2},{5,6,3,4,1,2},
                {6,2,4,3,5,1},{6,3,2,5,4,1},{6,4,5,2,3,1},{6,5,3,4,2,1}};
string str,s;
int main()
{
    while(getline(cin,s))
    {
        str="";
        for(int i=6;i<12;i++)
        str+=s[i];
        int i;
        for(i=0;i<24;i++)
        {
            string ss="";
            for(int j=0;j<6;j++)
            ss+=s[ans[i][j]-1];
            if(ss==str){cout<<"TRUE"<<endl;break;}
        }
        if(i>=24)cout<<"FALSE"<<endl;
    }
}