#include #include int grid[9][9] = { {0, 0, 0, 0, 8, 0, 0, 0, 9}, {0, 0, 0, 4, 2, 6, 1, 3, 0}, {0, 0, 0, 9, 0, 1, 5, 0, 6}, {2, 0, 0, 8, 3, 0, 9, 7, 4}, {3, 0, 9, 0, 6, 0, 0, 8, 0}, {0, 0, 0, 2, 9, 4, 0, 0, 0}, {0, 5, 6, 3, 1, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 8, 0, 7}, {0, 8, 4, 0, 5, 2, 0, 1, 0}, }; int gridSolved[9][9] = { {6, 1, 2, 5, 8, 3, 7, 4, 9}, {5, 9, 7, 4, 2, 6, 1, 3, 8}, {4, 3, 8, 9, 7, 1, 5, 2, 6}, {2, 6, 1, 8, 3, 5, 9, 7, 4}, {3, 4, 9, 1, 6, 7, 2, 8, 5}, {8, 7, 5, 2, 9, 4, 3, 6, 1}, {7, 5, 6, 3, 1, 8, 4, 9, 2}, {1, 2, 3, 6, 4, 9, 8, 5, 7}, {9, 8, 4, 7, 5, 2, 6, 1, 3}, }; void printGrid() { for (int i = 0; i < 9; i++) { for (int j = 0; j < 9; j++) { if ((j == 3) || (j == 6)) printf("|"); printf("%d", grid[i][j]); } if ((i == 2) || (i == 5)) printf("\n___________"); printf("\n"); } } int checkColumn(int column, int num) { for (int i = 0; i < 9; i++) { if (grid[i][column] == num) return 1; } return 0; } int checkRow(int row, int num) { for (int i = 0; i < 9; i++) { if (grid[row][i] == num) return 1; } return 0; } int checkSubGrid(int row, int column, int num) { if (row <= 2) row = 3; else if (row > 2 && row <= 5) row = 6; else if (row > 5 && row <= 8) row = 9; if (column <= 2) column = 3; else if (column > 2 && column <= 5) column = 6; else if (column > 5 && column <= 8) column = 9; for (int i = row - 3; i < row; i++) { for (int j = column - 3; j < column; j++) { if (grid[i][j] == num) return 1; } } return 0; } void solve() { int r, c, s; for (int i = 0; i < 9; i++) { for (int j = 0; j < 9; j++) { for (int k = 1; k <= 9; k++) { r = checkRow(i, k); c = checkColumn(j, k); s = checkSubGrid(i, j, k); if (!r && !c && !s) { //printf("s:%dr:%dn:%d\n", i, j, k); grid[i][j] = k; } } } } } int main(int argc, char const *argv[]) { printGrid(); /* int d=checkSubGrid(atoi(argv[1]),atoi(argv[2]), atoi(argv[3])); printf("%d", d); */ solve(); printf("\n===========\nSOLVED GRID(ins)\n\n"); printGrid(); return 0; }

sudokuSolver