ADD file via upload

main
p7cx2jokr 3 weeks ago
parent b1b63276e4
commit 6ca8eea19a

@ -0,0 +1,100 @@
#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;
//判断每一行数字是否重复
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){
printf("False:Invalid initial Sudoku matrix!\n");
printf("The number %d in the col %d has been used!\n",j,i+1);
return;
}
}
}
//判断每一列数字是否重复
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){
printf("False:Invalid initial Sudoku matrix!\n");
printf("The number %d in the row %d has been used!\n",j,i+1);
return;
}
}
}
//判断每个九宫格数字是否重复
for(k=0;k<9;k++){
int cnt[10]={}; //统计每个数字出现次数
//起始行为k/3*3
for(i=k/3*3;i<k/3*3+3;i++){
//起始列为k%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");
}
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}};
check(board0);
check(board1);
return 0;
}
Loading…
Cancel
Save