数独sodu c++源程序

#include <iostream> #include <iomanip> using namespace std; int main() { int counter =0; int A[9][9] = { {0,6,0,2,0,4,0,5,0}, {4,7,0,0,6,0,0,8,3}, {0,0,5,0,7,0,1,0,0}, {9,0,0,1,0,3,0,0,2}, {0,1,2,0,0,0,3,4,0}, {6,0,0,7,0,9,0,0,8}, {0,0,6,0,8,0,7,0,0}, {1,4,0,0,9,0,0,2,5}, {0,8,0,3,0,5,0,9,0}}; int B[9][9]={ {1,2,3,4,5,6,7,8,9}, {2,3,4,5,6,7,8,9,1}, {3,4,5,6,7,8,9,1,2}, {4,5,6,7,8,9,1,2,3}, {5,6,7,8,9,1,2,3,4}, {6,7,8,9,1,2,3,4,5}, {7,8,9,1,2,3,4,5,6}, {8,9,1,2,3,4,5,6,7}, {9,1,2,3,4,5,6,7,8}}; /*for(int i = 0;i<9;i++){ for (int j =0; j<9;j++){ counter++; if(counter%9==1) cout<<endl; cout<<setw(2)<<A[i][j]<<" ";}}*/ int m; /*void swap(int C[m][],int first,int second) { int temp = C[m][first]; C[m][first] = C[m][second]; C[m][second] = temp; }*/ for(int i = 0;i<9;i++){ for(int j =0;j<9;j++){ if(A[i][j]!=0&&A[i][j]!=B[i][j]){ for(int k = 0;k<9;k++){ if(A[i][j]==B[i][k]){ int temp = B[i][j]; B[i][j] = B[i][k]; B[i][k] = temp; } } } } } for(int i = 0;i<9;i++){ for (int j =0; j<9;j++){ counter++; if(counter%9==1) cout<<endl; cout<<setw(2)<<B[i][j]<<" ";}} return 0; }