|
|
@ -1,183 +0,0 @@
|
|
|
|
#include <stdio.h>
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void print(int board[9][9]){
|
|
|
|
|
|
|
|
printf("|-----------------------|\n");
|
|
|
|
|
|
|
|
int i,j;
|
|
|
|
|
|
|
|
for(i=0;i<9;i++){
|
|
|
|
|
|
|
|
printf("| ");
|
|
|
|
|
|
|
|
for(j=0;j<9;j++){
|
|
|
|
|
|
|
|
if(board[i][j]==0) printf(". ");
|
|
|
|
|
|
|
|
else printf("%d ",board[i][j]);
|
|
|
|
|
|
|
|
if(j%3==2) printf("| ");
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
printf("\n");
|
|
|
|
|
|
|
|
if(i%3==2){
|
|
|
|
|
|
|
|
printf("|-----------------------|\n");
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void check(int board[9][9]){
|
|
|
|
|
|
|
|
printf("The original Sudoku matrix:\n");
|
|
|
|
|
|
|
|
print(board);
|
|
|
|
|
|
|
|
int i,j,k;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//„1¤7§Ø„1¤7<C2A4>0‹7<E280B9>0Ý5„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7<C2A4>0¢9„1¤7„1¤7<C2A4>1…6„1¤7
|
|
|
|
|
|
|
|
for(i=0;i<9;i++){
|
|
|
|
|
|
|
|
int cnt[10]={}; //<2F>0È1„1¤7„1¤7<C2A4>0‹7„1¤7„1¤7„1¤7„1¤7„1¤7<C2A4>0ö3„1¤7„1¤7<C2A4>0ö4„1¤7„1¤7„1¤7
|
|
|
|
|
|
|
|
for(j=0;j<9;j++){
|
|
|
|
|
|
|
|
cnt[board[i][j]]++;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
for(j=1;j<=9;j++){
|
|
|
|
|
|
|
|
if(cnt[j]>1){
|
|
|
|
|
|
|
|
printf("False:Invalid initial Sudoku matrix!\n");
|
|
|
|
|
|
|
|
printf("The number %d in the col %d has been used!\n",j,i+1);
|
|
|
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//„1¤7§Ø„1¤7<C2A4>0‹7<E280B9>0Ý5„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7<C2A4>0¢9„1¤7„1¤7<C2A4>1…6„1¤7
|
|
|
|
|
|
|
|
for(i=0;i<9;i++){
|
|
|
|
|
|
|
|
int cnt[10]={}; //<2F>0È1„1¤7„1¤7<C2A4>0‹7„1¤7„1¤7„1¤7„1¤7„1¤7<C2A4>0ö3„1¤7„1¤7<C2A4>0ö4„1¤7„1¤7„1¤7
|
|
|
|
|
|
|
|
for(j=0;j<9;j++){
|
|
|
|
|
|
|
|
cnt[board[j][i]]++;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
for(j=1;j<=9;j++){
|
|
|
|
|
|
|
|
if(cnt[j]>1){
|
|
|
|
|
|
|
|
printf("False:Invalid initial Sudoku matrix!\n");
|
|
|
|
|
|
|
|
printf("The number %d in the row %d has been used!\n",j,i+1);
|
|
|
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//„1¤7§Ø„1¤7<C2A4>0‹7„1¤7„1¤7„1¤7<C2A4>0—1„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7<C2A4>0¢9„1¤7„1¤7<C2A4>1…6„1¤7
|
|
|
|
|
|
|
|
for(k=0;k<9;k++){
|
|
|
|
|
|
|
|
int cnt[10]={}; //<2F>0È1„1¤7„1¤7<C2A4>0‹7„1¤7„1¤7„1¤7„1¤7„1¤7<C2A4>0ö3„1¤7„1¤7<C2A4>0ö4„1¤7„1¤7„1¤7
|
|
|
|
|
|
|
|
//„1¤7„1¤7<C2A4>0¶3„1¤7„1¤7<C2A4>0Ë2k/3*3
|
|
|
|
|
|
|
|
for(i=k/3*3;i<k/3*3+3;i++){
|
|
|
|
|
|
|
|
//„1¤7„1¤7<C2A4>0¶3„1¤7„1¤7<C2A4>0Ë2k%3*3
|
|
|
|
|
|
|
|
for(j=k%3*3;j<k%3*3+3;j++){
|
|
|
|
|
|
|
|
cnt[board[i][j]]++;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
for(j=1;j<=9;j++){
|
|
|
|
|
|
|
|
if(cnt[j]>1){
|
|
|
|
|
|
|
|
printf("False:Invalid initial Sudoku matrix!\n");
|
|
|
|
|
|
|
|
printf("The number %d in the block %d has been used!\n",j,k+1);
|
|
|
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
printf("True:Valid initial Sudoku matrix!\n");
|
|
|
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//„1¤7„1¤7„1¤7„1¤7check_plus„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7§Ø„1¤7„1¤7<C2A4>0¢9„1¤7<C2A4>0Ë2„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7
|
|
|
|
|
|
|
|
int check_plus(int board[9][9]){
|
|
|
|
|
|
|
|
int i,j,k;
|
|
|
|
|
|
|
|
for(i=0;i<9;i++){
|
|
|
|
|
|
|
|
int cnt[10]={};
|
|
|
|
|
|
|
|
for(j=0;j<9;j++){
|
|
|
|
|
|
|
|
cnt[board[i][j]]++;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
for(j=1;j<=9;j++){
|
|
|
|
|
|
|
|
if(cnt[j]>1){
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
for(i=0;i<9;i++){
|
|
|
|
|
|
|
|
int cnt[10]={};
|
|
|
|
|
|
|
|
for(j=0;j<9;j++){
|
|
|
|
|
|
|
|
cnt[board[j][i]]++;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
for(j=1;j<=9;j++){
|
|
|
|
|
|
|
|
if(cnt[j]>1){
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
for(k=0;k<9;k++){
|
|
|
|
|
|
|
|
int cnt[10]={};
|
|
|
|
|
|
|
|
for(i=k/3*3;i<k/3*3+3;i++){
|
|
|
|
|
|
|
|
for(j=k%3*3;j<k%3*3+3;j++){
|
|
|
|
|
|
|
|
cnt[board[i][j]]++;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
for(j=1;j<=9;j++){
|
|
|
|
|
|
|
|
if(cnt[j]>1){
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int solve(int board[9][9]){
|
|
|
|
|
|
|
|
int i,j;
|
|
|
|
|
|
|
|
for(i=0;i<9;i++){
|
|
|
|
|
|
|
|
for(j=0;j<9;j++){
|
|
|
|
|
|
|
|
if(board[i][j]==0){ //„1¤7<C2A4>0Ü9„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7¦Ë„1¤7„1¤7
|
|
|
|
|
|
|
|
int num; //„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7§Õ1~9
|
|
|
|
|
|
|
|
for(num=1;num<=9;num++){
|
|
|
|
|
|
|
|
board[i][j]=num;
|
|
|
|
|
|
|
|
//„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7ƒ6Ý5„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7<C2A4>1¥7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7
|
|
|
|
|
|
|
|
if(check_plus(board)){
|
|
|
|
|
|
|
|
if(solve(board)){
|
|
|
|
|
|
|
|
return 1; //„1¤7<C2A4>0¯6„1¤7„1¤7„1¤7§Õ„1¤7„1¤7„1¤7<C2A4>0Ü9„1¤7<C2A4>0Ý5„1¤7„1¤7„1¤7
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
board[i][j]=0; //„1¤7<C2A4>1¬5<C2AC>7í0„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7<C2A4>0Ý5„1¤7„1¤7„1¤7„1¤7
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0; //„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7ƒ8‚7„1¤7„1¤7„1¤7<C2A4>1«9„1¤7„1¤7„1¤7„1¤7‚0î4<C3AE>0»5„1¤7„1¤7„1¤7<C2A4>1¬5„1¤7
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void final_step(int board[9][9]){
|
|
|
|
|
|
|
|
check(board);
|
|
|
|
|
|
|
|
if(solve(board)){
|
|
|
|
|
|
|
|
printf("The solution of Sudoku matrix:\n");
|
|
|
|
|
|
|
|
print(board);
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
else printf("No solution„1¤7„1¤7\n");
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int main(){
|
|
|
|
|
|
|
|
int board0[9][9] = {{5, 3, 0, 0, 7, 0, 0, 0, 0},
|
|
|
|
|
|
|
|
{6, 0, 0, 1, 9, 5, 0, 0, 0},
|
|
|
|
|
|
|
|
{0, 9, 8, 0, 0, 0, 0, 6, 0},
|
|
|
|
|
|
|
|
{8, 0, 0, 0, 6, 0, 0, 0, 3},
|
|
|
|
|
|
|
|
{4, 0, 0, 8, 0, 3, 0, 0, 1},
|
|
|
|
|
|
|
|
{7, 0, 0, 0, 2, 0, 0, 0, 6},
|
|
|
|
|
|
|
|
{0, 6, 0, 0, 0, 0, 2, 8, 0},
|
|
|
|
|
|
|
|
{0, 0, 0, 4, 1, 9, 0, 0, 5},
|
|
|
|
|
|
|
|
{0, 0, 0, 0, 8, 0, 0, 7, 9}};
|
|
|
|
|
|
|
|
int board1[9][9] = {{8, 3, 0, 0, 7, 0, 0, 0, 0},
|
|
|
|
|
|
|
|
{6, 0, 0, 1, 9, 5, 0, 0, 0},
|
|
|
|
|
|
|
|
{0, 9, 8, 0, 0, 0, 0, 6, 0},
|
|
|
|
|
|
|
|
{8, 0, 0, 0, 6, 0, 0, 0, 3},
|
|
|
|
|
|
|
|
{4, 0, 0, 8, 0, 3, 0, 0, 1},
|
|
|
|
|
|
|
|
{7, 0, 0, 0, 2, 0, 0, 0, 6},
|
|
|
|
|
|
|
|
{0, 6, 0, 0, 0, 0, 2, 8, 0},
|
|
|
|
|
|
|
|
{0, 0, 0, 4, 1, 9, 0, 0, 5},
|
|
|
|
|
|
|
|
{0, 0, 0, 0, 8, 0, 0, 7, 9}};
|
|
|
|
|
|
|
|
int board2[9][9] = {{5, 2, 0, 0, 7, 0, 0, 0, 0},
|
|
|
|
|
|
|
|
{6, 0, 0, 1, 9, 5, 0, 0, 0},
|
|
|
|
|
|
|
|
{0, 9, 8, 0, 0, 0, 0, 6, 0},
|
|
|
|
|
|
|
|
{8, 0, 0, 0, 6, 0, 0, 0, 3},
|
|
|
|
|
|
|
|
{4, 0, 0, 8, 0, 3, 0, 0, 1},
|
|
|
|
|
|
|
|
{7, 0, 0, 0, 2, 0, 0, 0, 6},
|
|
|
|
|
|
|
|
{0, 6, 0, 0, 0, 0, 2, 8, 0},
|
|
|
|
|
|
|
|
{0, 0, 0, 4, 1, 9, 0, 0, 5},
|
|
|
|
|
|
|
|
{0, 0, 0, 0, 8, 0, 0, 7, 9}};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
final_step(board0);
|
|
|
|
|
|
|
|
final_step(board1);
|
|
|
|
|
|
|
|
final_step(board2);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
}
|
|
|
|
|