爆搜爆搜

最新推荐文章于 2022-10-13 21:17:32 发布

dongdongdong122

最新推荐文章于 2022-10-13 21:17:32 发布

阅读量1.2k

点赞数

CC 4.0 BY-SA版权

分类专栏：爆搜爆搜文章标签：爆搜爆搜

本文链接：https://blog.youkuaiyun.com/dongdongdong122/article/details/52261720

爆搜爆搜专栏收录该内容

1 篇文章

订阅专栏

代码：

#include "iostream"
#include "cstdlib"
#include "cstring"
using namespace std;
int map[6];
int Ans=0;
int list[15][6]= {{0,0,1,1,1,1},
    {0,1,0,1,1,1},
    {0,1,1,0,1,1},
    {0,1,1,1,0,1},
    {0,1,1,1,1,0},
    {1,0,0,1,1,1},
    {1,0,1,0,1,1},
    {1,0,1,1,0,1},
    {1,0,1,1,1,0},
    {1,1,0,0,1,1},
    {1,1,0,1,0,1},
    {1,1,0,1,1,0},
    {1,1,1,0,0,1},
    {1,1,1,0,1,0},
    {1,1,1,1,0,0}
};
void dfs( int layer )
{
    if(layer==-1)
    {
        for ( int i=0; i<=5; i++)
            if(list[map[0]][i]+list[map[1]][i]+list[map[2]][i]+list[map[3]][i]+list[map[4]][i]+list[map[5]][i]!=4) return ;
//        	 for ( int i=0;i<=5;i++)
//        	  {
//        	     for ( int j=0;j<=5;j++)
//        	        cout << list[map[i]][j];
//        	     cout << endl;
//        	  }
//        	  cout << endl;
        Ans++;
        return ;
    }
    for ( int i=0; i<15; i++)
    {
        map[layer]=i;
        dfs(layer-1);
    }
    return ;
}
int main()
{
    memset(map,0,sizeof(map));
    dfs(5);
    cout << Ans << endl;
    return 0;
}

多看看，多看看。