p7cx2jokr
/
matrix
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update file4.c

Browse Source
main
p7cx2jokr 8 months ago
parent 28643556c3
commit 9609382f5a
1 changed files with 183 additions and 183 deletions
Show Stats Download Patch File Download Diff File

366
file4.c
Unescape View File

@ -1,183 +1,183 @@
#include <stdio.h> #include <stdio.h>
void print(int board[9][9]){ void print(int board[9][9]){
printf("|-----------------------|\n"); printf("|-----------------------|\n");
int i,j; int i,j;
for(i=0;i<9;i++){ for(i=0;i<9;i++){
printf("| "); printf("| ");
for(j=0;j<9;j++){ for(j=0;j<9;j++){
if(board[i][j]==0) printf(". "); if(board[i][j]==0) printf(". ");
else printf("%d ",board[i][j]); else printf("%d ",board[i][j]);
if(j%3==2) printf("| "); if(j%3==2) printf("| ");
} }
printf("\n"); printf("\n");
if(i%3==2){ if(i%3==2){
printf("|-----------------------|\n"); printf("|-----------------------|\n");
} }
} }
} }
void check(int board[9][9]){ void check(int board[9][9]){
printf("The original Sudoku matrix:\n"); printf("The original Sudoku matrix:\n");
print(board); print(board);
int i,j,k; int i,j,k;
//判断每一行数字是否重复 //„1¤7§Ø„1¤7<EFBFBD>0‹7<EFBFBD>0Ý5„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7<EFBFBD>0¢9„1¤7„1¤7<EFBFBD>1…6„1¤7
for(i=0;i<9;i++){ for(i=0;i<9;i++){
int cnt[10]={}; //统计每个数字出现次数 int cnt[10]={}; //<EFBFBD>0È1„1¤7„1¤7<EFBFBD>0‹7„1¤7„1¤7„1¤7„1¤7„1¤7<EFBFBD>0ö3„1¤7„1¤7<EFBFBD>0ö4„1¤7„1¤7„1¤7
for(j=0;j<9;j++){ for(j=0;j<9;j++){
cnt[board[i][j]]++; cnt[board[i][j]]++;
} }
for(j=1;j<=9;j++){ for(j=1;j<=9;j++){
if(cnt[j]>1){ if(cnt[j]>1){
printf("False:Invalid initial Sudoku matrix!\n"); printf("False:Invalid initial Sudoku matrix!\n");
printf("The number %d in the col %d has been used!\n",j,i+1); printf("The number %d in the col %d has been used!\n",j,i+1);
return; return;
} }
} }
} }
//判断每一列数字是否重复 //„1¤7§Ø„1¤7<EFBFBD>0‹7<EFBFBD>0Ý5„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7<EFBFBD>0¢9„1¤7„1¤7<EFBFBD>1…6„1¤7
for(i=0;i<9;i++){ for(i=0;i<9;i++){
int cnt[10]={}; //统计每个数字出现次数 int cnt[10]={}; //<EFBFBD>0È1„1¤7„1¤7<EFBFBD>0‹7„1¤7„1¤7„1¤7„1¤7„1¤7<EFBFBD>0ö3„1¤7„1¤7<EFBFBD>0ö4„1¤7„1¤7„1¤7
for(j=0;j<9;j++){ for(j=0;j<9;j++){
cnt[board[j][i]]++; cnt[board[j][i]]++;
} }
for(j=1;j<=9;j++){ for(j=1;j<=9;j++){
if(cnt[j]>1){ if(cnt[j]>1){
printf("False:Invalid initial Sudoku matrix!\n"); printf("False:Invalid initial Sudoku matrix!\n");
printf("The number %d in the row %d has been used!\n",j,i+1); printf("The number %d in the row %d has been used!\n",j,i+1);
return; return;
} }
} }
} }
//判断每个九宫格数字是否重复 //„1¤7§Ø„1¤7<EFBFBD>0‹7„1¤7„1¤7„1¤7<EFBFBD>0—1„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7<EFBFBD>0¢9„1¤7„1¤7<EFBFBD>1…6„1¤7
for(k=0;k<9;k++){ for(k=0;k<9;k++){
int cnt[10]={}; //统计每个数字出现次数 int cnt[10]={}; //<EFBFBD>0È1„1¤7„1¤7<EFBFBD>0‹7„1¤7„1¤7„1¤7„1¤7„1¤7<EFBFBD>0ö3„1¤7„1¤7<EFBFBD>0ö4„1¤7„1¤7„1¤7
//起始行为k/3*3 //„1¤7„1¤7<EFBFBD>0¶3„1¤7„1¤7<EFBFBD>0Ë2k/3*3
for(i=k/3*3;i<k/3*3+3;i++){ for(i=k/3*3;i<k/3*3+3;i++){
//起始列为k%3*3 //„1¤7„1¤7<EFBFBD>0¶3„1¤7„1¤7<EFBFBD>0Ë2k%3*3
for(j=k%3*3;j<k%3*3+3;j++){ for(j=k%3*3;j<k%3*3+3;j++){
cnt[board[i][j]]++; cnt[board[i][j]]++;
} }
} }
for(j=1;j<=9;j++){ for(j=1;j<=9;j++){
if(cnt[j]>1){ if(cnt[j]>1){
printf("False:Invalid initial Sudoku matrix!\n"); printf("False:Invalid initial Sudoku matrix!\n");
printf("The number %d in the block %d has been used!\n",j,k+1); printf("The number %d in the block %d has been used!\n",j,k+1);
return; return;
} }
} }
} }
printf("True:Valid initial Sudoku matrix!\n"); printf("True:Valid initial Sudoku matrix!\n");
return; return;
} }
//定义check_plus函数，判断是否为数独矩阵 //„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<EFBFBD>0¢9„1¤7<EFBFBD>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 check_plus(int board[9][9]){
int i,j,k; int i,j,k;
for(i=0;i<9;i++){ for(i=0;i<9;i++){
int cnt[10]={}; int cnt[10]={};
for(j=0;j<9;j++){ for(j=0;j<9;j++){
cnt[board[i][j]]++; cnt[board[i][j]]++;
} }
for(j=1;j<=9;j++){ for(j=1;j<=9;j++){
if(cnt[j]>1){ if(cnt[j]>1){
return 0; return 0;
} }
} }
} }
for(i=0;i<9;i++){ for(i=0;i<9;i++){
int cnt[10]={}; int cnt[10]={};
for(j=0;j<9;j++){ for(j=0;j<9;j++){
cnt[board[j][i]]++; cnt[board[j][i]]++;
} }
for(j=1;j<=9;j++){ for(j=1;j<=9;j++){
if(cnt[j]>1){ if(cnt[j]>1){
return 0; return 0;
} }
} }
} }
for(k=0;k<9;k++){ for(k=0;k<9;k++){
int cnt[10]={}; int cnt[10]={};
for(i=k/3*3;i<k/3*3+3;i++){ for(i=k/3*3;i<k/3*3+3;i++){
for(j=k%3*3;j<k%3*3+3;j++){ for(j=k%3*3;j<k%3*3+3;j++){
cnt[board[i][j]]++; cnt[board[i][j]]++;
} }
} }
for(j=1;j<=9;j++){ for(j=1;j<=9;j++){
if(cnt[j]>1){ if(cnt[j]>1){
return 0; return 0;
} }
} }
} }
return 1; return 1;
} }
int solve(int board[9][9]){ int solve(int board[9][9]){
int i,j; int i,j;
for(i=0;i<9;i++){ for(i=0;i<9;i++){
for(j=0;j<9;j++){ for(j=0;j<9;j++){
if(board[i][j]==0){ //找到待填的位置 if(board[i][j]==0){ //„1¤7<EFBFBD>0Ü9„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7¦Ë„1¤7„1¤7
int num; //遍历填写1~9 int num; //„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7§Õ1~9
for(num=1;num<=9;num++){ for(num=1;num<=9;num++){
board[i][j]=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<EFBFBD>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(check_plus(board)){
if(solve(board)){ if(solve(board)){
return 1; //成功填写，找到一组解 return 1; //„1¤7<EFBFBD>0¯6„1¤7„1¤7„1¤7§Õ„1¤7„1¤7„1¤7<EFBFBD>0Ü9„1¤7<EFBFBD>0Ý5„1¤7„1¤7„1¤7
} }
} }
board[i][j]=0; //无解，继续尝试下一个数 board[i][j]=0; //„1¤7<EFBFBD>1¬5<EFBFBD>7í0„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7<EFBFBD>0Ý5„1¤7„1¤7„1¤7„1¤7
} }
return 0; //若不管填几都无法满足，说明无解 return 0; //„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7„1¤7ƒ8‚7„1¤7„1¤7„1¤7<EFBFBD>1«9„1¤7„1¤7„1¤7„1¤7‚0î4<EFBFBD>0»5„1¤7„1¤7„1¤7<EFBFBD>1¬5„1¤7
} }
} }
} }
} }
void final_step(board){ void final_step(int board[9][9]){
check(board); check(board);
if(solve(board)){ if(solve(board)){
printf("The solution of Sudoku matrix:\n"); printf("The solution of Sudoku matrix:\n");
print(board); print(board);
} }
else printf("No solution！\n"); else printf("No solution„1¤7„1¤7\n");
} }
int main(){ int main(){
int board0[9][9] = {{5, 3, 0, 0, 7, 0, 0, 0, 0}, int board0[9][9] = {{5, 3, 0, 0, 7, 0, 0, 0, 0},
{6, 0, 0, 1, 9, 5, 0, 0, 0}, {6, 0, 0, 1, 9, 5, 0, 0, 0},
{0, 9, 8, 0, 0, 0, 0, 6, 0}, {0, 9, 8, 0, 0, 0, 0, 6, 0},
{8, 0, 0, 0, 6, 0, 0, 0, 3}, {8, 0, 0, 0, 6, 0, 0, 0, 3},
{4, 0, 0, 8, 0, 3, 0, 0, 1}, {4, 0, 0, 8, 0, 3, 0, 0, 1},
{7, 0, 0, 0, 2, 0, 0, 0, 6}, {7, 0, 0, 0, 2, 0, 0, 0, 6},
{0, 6, 0, 0, 0, 0, 2, 8, 0}, {0, 6, 0, 0, 0, 0, 2, 8, 0},
{0, 0, 0, 4, 1, 9, 0, 0, 5}, {0, 0, 0, 4, 1, 9, 0, 0, 5},
{0, 0, 0, 0, 8, 0, 0, 7, 9}}; {0, 0, 0, 0, 8, 0, 0, 7, 9}};
int board1[9][9] = {{8, 3, 0, 0, 7, 0, 0, 0, 0}, int board1[9][9] = {{8, 3, 0, 0, 7, 0, 0, 0, 0},
{6, 0, 0, 1, 9, 5, 0, 0, 0}, {6, 0, 0, 1, 9, 5, 0, 0, 0},
{0, 9, 8, 0, 0, 0, 0, 6, 0}, {0, 9, 8, 0, 0, 0, 0, 6, 0},
{8, 0, 0, 0, 6, 0, 0, 0, 3}, {8, 0, 0, 0, 6, 0, 0, 0, 3},
{4, 0, 0, 8, 0, 3, 0, 0, 1}, {4, 0, 0, 8, 0, 3, 0, 0, 1},
{7, 0, 0, 0, 2, 0, 0, 0, 6}, {7, 0, 0, 0, 2, 0, 0, 0, 6},
{0, 6, 0, 0, 0, 0, 2, 8, 0}, {0, 6, 0, 0, 0, 0, 2, 8, 0},
{0, 0, 0, 4, 1, 9, 0, 0, 5}, {0, 0, 0, 4, 1, 9, 0, 0, 5},
{0, 0, 0, 0, 8, 0, 0, 7, 9}}; {0, 0, 0, 0, 8, 0, 0, 7, 9}};
int board2[9][9] = {{5, 2, 0, 0, 7, 0, 0, 0, 0}, int board2[9][9] = {{5, 2, 0, 0, 7, 0, 0, 0, 0},
{6, 0, 0, 1, 9, 5, 0, 0, 0}, {6, 0, 0, 1, 9, 5, 0, 0, 0},
{0, 9, 8, 0, 0, 0, 0, 6, 0}, {0, 9, 8, 0, 0, 0, 0, 6, 0},
{8, 0, 0, 0, 6, 0, 0, 0, 3}, {8, 0, 0, 0, 6, 0, 0, 0, 3},
{4, 0, 0, 8, 0, 3, 0, 0, 1}, {4, 0, 0, 8, 0, 3, 0, 0, 1},
{7, 0, 0, 0, 2, 0, 0, 0, 6}, {7, 0, 0, 0, 2, 0, 0, 0, 6},
{0, 6, 0, 0, 0, 0, 2, 8, 0}, {0, 6, 0, 0, 0, 0, 2, 8, 0},
{0, 0, 0, 4, 1, 9, 0, 0, 5}, {0, 0, 0, 4, 1, 9, 0, 0, 5},
{0, 0, 0, 0, 8, 0, 0, 7, 9}}; {0, 0, 0, 0, 8, 0, 0, 7, 9}};
final_step(board0); final_step(board0);
final_step(board1); final_step(board1);
final_step(board2); final_step(board2);
return 0; return 0;
} }

Write Preview
Loading…
Cancel
Save