From 8a0a1f6acf8d1d0f91db135c0695115b112a162d Mon Sep 17 00:00:00 2001 From: p7cx2jokr <2160925370@qq.com> Date: Wed, 6 Nov 2024 19:40:58 +0800 Subject: [PATCH] Delete 'file4.c' --- file4.c | 183 -------------------------------------------------------- 1 file changed, 183 deletions(-) delete mode 100644 file4.c diff --git a/file4.c b/file4.c deleted file mode 100644 index 55d3ae5..0000000 --- a/file4.c +++ /dev/null @@ -1,183 +0,0 @@ -#include - -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;i1){ - 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"); - return; -} - -//����check_plus�������ж��Ƿ�Ϊ�������� -int check_plus(int board[9][9]){ - 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){ - return 0; - } - } - } - 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){ - return 0; - } - } - } - for(k=0;k<9;k++){ - int cnt[10]={}; - for(i=k/3*3;i1){ - return 0; - } - } - } - return 1; -} - -int solve(int board[9][9]){ - int i,j; - for(i=0;i<9;i++){ - for(j=0;j<9;j++){ - if(board[i][j]==0){ //�ҵ������λ�� - int num; //������д1~9 - for(num=1;num<=9;num++){ - board[i][j]=num; - //�������������ݹ���������� - if(check_plus(board)){ - if(solve(board)){ - return 1; //�ɹ���д���ҵ�һ��� - } - } - board[i][j]=0; //�޽⣬����������һ���� - } - return 0; //����������޷����㣬˵���޽� - } - } - } -} - -void final_step(int board[9][9]){ - check(board); - if(solve(board)){ - printf("The solution of Sudoku matrix:\n"); - print(board); - } - else printf("No solution��\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}}; - int board2[9][9] = {{5, 2, 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}}; - - final_step(board0); - final_step(board1); - final_step(board2); - - return 0; -}