#include int inside(); // checking if zeros are still present int check(int, int); // checking for opportunity to fill the zero with correct value int arr[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 main(){ while (inside()){ for (int i = 0; i < 9; i++){ for (int j = 0; j < 9; j++){ if (arr[i][j] == 0){ arr[i][j] = check(i, j); } } } } for (int i = 0; i < 9; i++){ for (int j = 0; j < 9; j++){ printf("%2d",arr[i][j]); } printf("\n"); } } int inside(){ for (int i = 0; i < 9; i++){ for (int j = 0; j < 9; j++){ if (arr[i][j] == 0){ return 1; } } } return 0; } int check(int i, int j){ int chkarr[9] = {0,0,0,0,0,0,0,0,0}; int count = 0, temp, bc, br; // checking in row for (int r = 0; r < 9; r++){ temp = arr[i][r]; if (temp != 0){ if (chkarr[temp - 1] == 0){ chkarr[temp - 1] = temp; count++; } } } // checking in column for (int c = 0; c < 9; c++){ temp = arr[c][j]; if (temp != 0){ if (chkarr[temp - 1] == 0){ chkarr[temp - 1] = temp; count++; } } } // checking in box br = i/3*3; // box row start index bc = j/3*3; // box column start index for (int x = br; x < br+3; x++){ for (int y = bc; y < bc+3; y++){ temp = arr[x][y]; if (temp != 0){ if (chkarr[temp - 1] == 0){ chkarr[temp - 1] = temp; count++; } } } } if (count == 8){ for (int f = 0; f < 9; f++){ if (chkarr[f] == 0){ return f+1; } } } return 0; }

Sudoku_Solver