ADD file via upload

main
p8btn9vm4 3 weeks ago
parent d1cd1a90ea
commit 5deb5e993f

@ -0,0 +1,141 @@
#include <stdio.h>
#include <stdbool.h>
#define SIZE 9
void print_sudoku(int matrix[SIZE][SIZE]) {
for (int i = 0; i < SIZE; i++) {
for (int j = 0; j < SIZE; j++) {
printf("%d ", matrix[i][j]);
if ((j + 1) % 3 == 0 && j != 8) {
printf("| ");
}
}
printf("\n");
if ((i + 1) % 3 == 0 && i != 8) {
printf("------+-------+------\n");
}
}
}
bool is_valid_sudoku(int matrix[SIZE][SIZE]) {
// 检查行、列和 3x3 小块
for (int i = 0; i < SIZE; i++) {
bool row_check[SIZE + 1] = { false }; // 用于检查行中 1-9 的出现情况
bool col_check[SIZE + 1] = { false }; // 用于检查列中 1-9 的出现情况
for (int j = 0; j < SIZE; j++) {
// 检查行
if (matrix[i][j] != 0) {
if (row_check[matrix[i][j]]) {
printf("False:Invalid initial Sudoku matrix!\n");
printf("The number %d in the row %d has been used!\n", matrix[i][j], i + 1);
return false;
}
row_check[matrix[i][j]] = true;
}
// 检查列
if (matrix[j][i] != 0) {
if (col_check[matrix[j][i]]) {
printf("False:Invalid initial Sudoku matrix!\n");
printf("The number %d in the col %d has been used!\n", matrix[j][i], i + 1);
return false;
}
col_check[matrix[j][i]] = true;
}
}
}
// 检查 3x3 小块
for (int start_row = 0; start_row < SIZE; start_row += 3) {
for (int start_col = 0; start_col < SIZE; start_col += 3) {
bool block_check[SIZE + 1] = { false }; // 用于检查 3x3 小块
for (int i = start_row; i < start_row + 3; i++) {
for (int j = start_col; j < start_col + 3; j++) {
if (matrix[i][j] != 0) {
if (block_check[matrix[i][j]]) {
printf("False:Invalid initial Sudoku matrix!\n");
printf("The number %d in the block %d has been used!\n", matrix[i][j], (start_row / 3) * 3 + (start_col / 3) + 1);
return false;
}
block_check[matrix[i][j]] = true;
}
}
}
}
}
return true;
}
bool is_safe(int matrix[SIZE][SIZE], int row, int col, int num) {
for (int x = 0; x < SIZE; x++) {
if (matrix[row][x] == num || matrix[x][col] == num) {
return false;
}
}
int startRow = row - row % 3, startCol = col - col % 3;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (matrix[i + startRow][j + startCol] == num) {
return false;
}
}
}
return true;
}
bool solve_sudoku(int matrix[SIZE][SIZE]) {
for (int row = 0; row < SIZE; row++) {
for (int col = 0; col < SIZE; col++) {
if (matrix[row][col] == 0) {
for (int num = 1; num <= 9; num++) {
if (is_safe(matrix, row, col, num)) {
matrix[row][col] = num;
if (solve_sudoku(matrix)) {
return true;
}
matrix[row][col] = 0; // 撤销选择
}
}
return false; // 如果没有数字能够放入,返回 false
}
}
}
return true; // 成功解决数独
}
int main() {
int sudoku_matrix[SIZE][SIZE] = {
{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}
};
printf("The original Sudoku matrix:\n");
print_sudoku(sudoku_matrix);
if (is_valid_sudoku(sudoku_matrix)) {
printf("True:Valid initial Sudoku matrix!\n");
if (solve_sudoku(sudoku_matrix)) {
printf("The solution of Sudoku matrix:\n");
print_sudoku(sudoku_matrix);
}
else {
printf("No solution!\n");
}
}
else {
printf("No solution!\n");
}
return 0;
}
Loading…
Cancel
Save