方格填数

如下的10个格子

填入0~9的数字。要求：连续的两个数字不能相邻。
（左右、上下、对角都算相邻）
一共有多少种可能的填数方案？
请填写表示方案数目的整数。
注意：你提交的应该是一个整数，不要填写任何多余的内容或说明性文字。

我觉得有点歧义，不知道数字能不能重复，我就用不重复的做法做的，如果数字可以重复，那就复杂多了，应该不会那么复杂。这里没用什么搜索算法，就用最直接的每个都访问判断一遍，渣代码如下

#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    int m[3][4] = { 0 };
    int listNumber[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
    int count = 0;

    do
    {
        int ok = 1;
        //三个循环给m赋值
        for (int i = 1, j = 0; i <= 3, j <= 2; i++, j++)
        {
            m[0][i] = listNumber[j];
        }
        for (int i = 0, j = 3; i <= 3, j <= 6; i++, j++)
        {
            m[1][i] = listNumber[j];
        }
        for (int i = 0, j = 7; i <= 2, j <= 9; i++, j++)
        {
            m[2][i] = listNumber[j];
        }

        //m[0][1]
        if (abs(m[0][1] - m[0][2]) == 1 || abs(m[0][1] - m[1][2]) == 1
                || abs(m[0][1] - m[1][1]) == 1 || abs(m[0][1] - m[1][0]) == 1)
        {
            ok = 0;
            continue;
        }
        //m[0][2]
        if (abs(m[0][2] - m[0][1]) == 1 || abs(m[0][2] - m[0][3]) == 1
                || abs(m[0][2] - m[1][3]) == 1 || abs(m[0][2] - m[1][2]) == 1
                || abs(m[0][2] - m[1][1]) == 1)
        {
            ok = 0;
            continue;
        }
        //m[0][3]
        if (abs(m[0][3] - m[1][3]) == 1 || abs(m[0][3] - m[1][2]) == 1
                || abs(m[0][3] - m[0][2]) == 1)
        {
            ok = 0;
            continue;
        }

        //m[1][0]
        if (abs(m[1][0] - m[0][1]) == 1 || abs(m[1][0] - m[1][1]) == 1
                || abs(m[1][0] - m[2][1]) == 1 || abs(m[1][0] - m[2][0]) == 1)
        {
            ok = 0;
            continue;
        }

        //m[1][1]
        if (abs(m[1][1] - m[0][1]) == 1 || abs(m[1][1] - m[0][2]) == 1
                || abs(m[1][1] - m[1][2]) == 1 || abs(m[1][1] - m[2][2]) == 1
                || abs(m[1][1] - m[2][1]) == 1 || abs(m[1][1] - m[2][0]) == 1
                || abs(m[1][1] - m[1][0]) == 1)
        {
            ok = 0;
            continue;
        }
        //m[1][2]
        if (abs(m[1][2] - m[0][2]) == 1 || abs(m[1][2] - m[0][3]) == 1
                || abs(m[1][2] - m[1][3]) == 1 || abs(m[1][2] - m[2][2]) == 1
                || abs(m[1][2] - m[2][1]) == 1 || abs(m[1][2] - m[1][1]) == 1
                || abs(m[1][2] - m[0][1]) == 1)
        {
            ok = 0;
            continue;
        }

        //m[1][3]
        if (abs(m[1][3] - m[0][3]) == 1 || abs(m[1][3] - m[0][2]) == 1
                || abs(m[1][3] - m[1][2]) == 1 || abs(m[1][3] - m[2][2]) == 1)
        {
            ok = 0;
            continue;
        }
        //m[2][0]
        if (abs(m[2][0] - m[1][0]) == 1 || abs(m[2][0] - m[1][1]) == 1
                || abs(m[2][0] - m[2][1]) == 1)
        {
            ok = 0;
            continue;
        }

        //m[2][1]
        if (abs(m[2][1] - m[2][0]) == 1 || abs(m[2][1] - m[1][0]) == 1
                || abs(m[2][1] - m[1][1]) == 1 || abs(m[2][1] - m[1][2]) == 1
                || abs(m[2][1] - m[2][2]) == 1)
        {
            ok = 0;
            continue;
        }
        //m[2][2]
        if (abs(m[2][2] - m[2][1]) == 1 || abs(m[2][2] - m[1][1]) == 1
                || abs(m[2][2] - m[1][2]) == 1 || abs(m[2][2] - m[1][3]) == 1)
        {
            ok = 0;
            continue;
        }

        if (ok == 1)
        {
            count++;
            cout << "\n********************" << endl;
            for (int i = 0; i < 3; i++)
            {
                for (int j = 0; j < 4; j++)
                {
                    cout << m[i][j] << " ";
                }
                cout << endl;
            }
            cout << "\n********************" << endl;
        }
//      for (int i = 0; i < 3; i++)
//      {
//          for (int  j = 0; j < 4; j++)
//          {
//              cout<<m[i][j]<<" ";
//          }
//          cout<<endl;
//      }
//      for (int i = 0; i < 10; i++)
//      {
//          cout<<listNumber[i]<<" ";
//      }
//      cout<<"\n********************"<<endl;

    } while (next_permutation(listNumber, listNumber + 10));
    cout << "count: " << count << endl;
    return 0;
}