/* 👉👉A solved sudoku puzzle is a matrix of typically 9*9 in which every row, every column and every block contains every number from 1 to 9 exactly once. 👉Try to find the correct values of the second sudoku by the hints given in output and comment answer in the comments section. 👉Try with different inputs on sudoku for Fun. Upvote if you like 👍👍 👉no need of input but you should change some elements in the second sudoku to make it a perfect one. */ #include int printChNums(int a[9][9]); int chRowCols(int a[9][9]); int smallSquare(int k, int l,int a[9][9]); int main() { int a[9][9]={ {3, 5, 2, 9, 1, 8, 6, 7, 4}, {8, 9, 7, 2, 4, 6, 5, 1, 3}, {6, 4, 1, 7, 5, 3, 2, 8, 9}, {7, 8, 3, 5, 6, 9, 4, 2, 1}, {9, 2, 6, 1, 3, 4, 7, 5, 8}, {4, 1, 5, 8, 2, 7, 9, 3, 6}, {1, 6, 4, 3, 7, 5, 8, 9, 2}, {2, 7, 8, 4, 9, 1, 3, 6, 5}, {5, 3, 9, 6, 8, 2, 1, 4, 7} }; int b[9][9]={ {6, 3, 2, 8, 9, 4, 5, 7, 1}, {4, 9, 5, 1, 3, 7, 6, 8, 2}, {8, 1, 7, 5, 9, 6, 4, 3, 9}, {3, 2, 0, 7, 1, 9, 8, 5, 6}, {7, 8, 1, 6, 5, 3, 9, 2, 4}, {9, 5, 6, 4, 8, 2, 3, 1, 7}, {2, 6, 3, 9, 7, 8, 1, 4, 5}, {1, 7, 9, 3, 4, 5, 2, 11, 8}, {5, 4, 8, 2, 6, 1, 7, 9, 3} }; int i,j,k; //checking validity of first sudoku k=printChNums(a); k+=chRowCols(a); for(i=0;i<9;i+=3) for(j=0;j<9;j+=3) k+=smallSquare(i,j,a); if(k) printf("\n Therefore this sudoku is invalid👎👎\n\n"); else printf(" This sudoku is valid👍👍\n\n"); //checking validity of second sudoku k=printChNums(b); k+=chRowCols(b); for(i=0;i<9;i+=3) for(j=0;j<9;j+=3) k+=smallSquare(i,j,b); if(k) printf("\n Therefore this sudoku is invalid👎👎\n\n"); else printf(" This sudoku is valid👍👍\n\n"); printf(" 🌞🌞Please upvote if you like🌞🌞"); return 0; } //this part checks whether the elements lies in 1-9 range . if any element doesn't fulfill this condition then the element will be highlighted with single quotes ''. int printChNums(int a[9][9]){ int i,j,k=0; for(i=0;i<9;i++,printf("\n")) for(j=0;j<9;j++){ if(a[i][j]>9||a[i][j]<1){ printf("\'%d\' ",a[i][j]); k++;} else printf("%d ",a[i][j]);} printf("\n"); if(k){ printf("➡️The element which is highlighted with single quotes is not in 1-9 range\n"); return 1;} else return 0; } //this check the rows and colums for any occurance of duplicates in a single row or in any single column. int chRowCols(int a[9][9]){ int i,j,k,count=0; for(i=0;i<9;i++) for(j=0;j<9;j++){ for(k=0;k<9;k++){ if((a[i][j]==a[i][k])||(a[i][j]==a[k][j])) count++; } if(((i!=j)&&count==2)||((i==j)&&count==1)) count=0; else{ printf("➡️Invalid sudoku. Input %d repeats in Row %d and in column %d \n",a[i][j],i,j); return 1; } } return 0; } //this checks the rows and columns of small squares in a sudoku (example: a square of starting element a[0][0] and ending element a[2][2]) for occurance of any duplicates. int smallSquare(int k, int l, int a[9][9]){ int sum=0,i,j; for(i=0+k;i<3+k;i++){ for(j=0+l;j<3+l;j++){ sum+=a[i][j]; } } if(sum!=45){ printf("➡️The small square whose starting point is [%d][%d] and ending is [%d][%d] has duplicates\n",k,l,i-1,j-1); return 1; } return 0; }

sukodu challenge