C++数独/计算出所有可能的结果

#include <iostream> #include <vector> using namespace std; vector <vector <int> > get(); void process(vector <vector <int> >,int,int); void display(vector <vector <int> >); vector <int> v(vector <vector <int> >,int,int); void main() { int a[9][9]= { {5,0,7,2,4,0,6,0,8}, {0,0,0,6,0,5,0,0,0}, {2,0,3,0,0,0,1,0,5}, {0,4,0,5,0,7,0,8,0}, {1,0,0,0,0,0,0,0,6}, {8,3,0,4,0,6,0,2,0}, {7,0,6,0,0,0,8,0,3}, {0,0,0,9,0,8,0,0,0}, {9,0,8,0,6,3,2,0,4}}; vector <vector <int> > num; for (int i=0;i<9;i++) { vector <int> temp(a[i],a[i]+9); num.push_back(temp); } process(num,0,0); } vector <vector <int> > get() { vector <vector <int> > temp; for (int i=0;i<9;i++) { vector <int> temp1; temp1.clear(); for (int j=0;j<9;j++) { int temp2; cin>>temp2; temp1.push_back(temp2); } temp.push_back(temp1); } return temp; } void process(vector <vector <int> > set,int x,int y) { if (x==9) { cout<<endl; display(set); cout<<endl; } else if (set[x][y]) { if (y==8) { y=0; x++; } else { y++; } process(set,x,y); } else { vector <int> temp=v(set,x,y); for (int i=0;i<temp.size();i++) { set[x][y]=temp[i]; int m=x,n=y; if (n==8) { n=0; m++; } else { n++; } process(set,m,n); } } } void display(vector <vector <int> > num) { static int count=1; cout<<"第"<<count<<"个解是:"<<endl; count++; for (int i=0;i<9;i++) { for (int j=0;j<9;j++) { cout<<num[i][j]<<" "; if (j%3==2) cout<<"\t"; } cout<<endl; if (i%3==2) cout<<endl; } } vector <int> v(vector <vector <int> >set,int x,int y) { int num[9]={1,2,3,4,5,6,7,8,9},i,j; vector <int> temp(num,num+9); for (i=0;i<9;i++) { if (set[x][i]) temp[set[x][i]-1]=0; if (set[i][y]) temp[set[i][y]-1]=0; } for (i=x/3*3;i<x/3*3+3;i++) for (j=y/3*3;j<y/3*3+3;j++) if (set[i][j]) temp[set[i][j]-1]=0; for (i=0;i<temp.size();i++) { if (!temp[i]) { temp.erase(temp.begin()+i); i--; } } return temp; }