生成所有的数独

/************************************************************************/
/*           计算输出所有符合条件的数独
                                                           */
/************************************************************************/
#include<iostream>
#include<vector>
using namespace std;


#define N 9
#define M 3
vector<int> v[N][N];
int Matrix[N][N] = {0};


//打印 9 X 9 数独
void print_matrix()
{
for (int i = 0; i < N; i++)
{
for(int j = 0; j < N; j++)
cout << Matrix[i][j] << " ";
cout << endl;
}
}


//获取指定坐标所能填入的数字列表
void getValueList(int row, int col)
{
int i, j;
int array[N+1] = {0};
for (i = 0; i < N; i++)
{
if (Matrix[i][col] != 0)
array[Matrix[i][col]] = Matrix[i][col];
if (Matrix[row][i] != 0)
array[Matrix[row][i]] = Matrix[row][i];
}


int row_size = row / M * M;
int col_size = col / M * M;
for (i = row_size; i < row_size + M; i++)
for (j = col_size; j < col_size + M; j++)
if (Matrix[i][j] != 0) 
array[Matrix[i][j]] = Matrix[i][j];


for (i = 1; i < N + 1; i++)
if (array[i] == 0) 
v[row][col].push_back(i);


}
//打印指定坐标位置上所能填入的数字列表
void print_v (int m, int n)
{
for (vector<int>::iterator iter = v[m][n].begin(); iter != v[m][n].end(); iter++)
cout << *iter << " ";
cout << endl;
}




int count = 0;//统计一共多少种符合条件的数独
// 计算机符合条件的数独
void setMatrix(int m, int n)
{
getValueList(m, n);
while (v[m][n].size())
{
Matrix[m][n] = v[m][n].back();
v[m][n].pop_back();

if (m == N - 1 && n == N - 1)
{
// print_v(m, n);
print_matrix();
count ++;
cout << count <<endl;
Matrix[m][n] = 0;
return;
}
if (n == N - 1)
{
setMatrix(m+1, 0);
}else
{
setMatrix(m, n+1);
}
Matrix[m][n] = 0;
}
}




void main()
{


setMatrix(0, 0);
cout << count <<endl;
print_matrix();
}