有问题请联系:
olympic2008@live.cn
采用两种算法
一种递归
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
char dict[9] ;
char ss[9][9] =
{
{'0','0','0','0','0','0','0','0','0'},
{'0','0','0','0','0','0','0','0','0'},
{'0','0','0','0','0','0','0','0','0'},
{'0','0','0','0','0','0','0','0','0'},
{'0','0','0','0','0','0','0','0','0'},
{'0','0','0','0','0','0','0','0','0'},
{'0','0','0','0','0','0','0','0','0'},
{'3','0','3','0','0','0','0','0','0'},
{'0','0','0','0','0','0','0','0','0'}
};
void formathengshu(int i,int j)
{
int m ;
int n;
for (m=0;m<9;m++)//a
{
for(n=0;n<9;n++)//ss
{
if ((ss[m][j] == dict[n]) || (ss[i][m]==dict[n]))
dict[n]='0';
}
}
}
void formatxiaofangge(int i,int j)
{
int m ;
int n;
int b;
int d ;
int s;
d = (i/3 + 1)*3;
s = (j/3 + 1)*3;
for (m=d-3;m<d;m++)//a
{
for(n=s-3;n<s;n++)//ss
{
for(b=0;b<9;b++)//ss
{
if (ss[m][n] == dict[b])
{
dict[b]='0';
}
}
}
}
}
int sort()
{
int i =0;
int j;
int m=0;
int n=0;
int min_m = 81;
int min=10;
char tmpdict[9];
char cCount=0;
for (;i<9;i++)
{
for (j=0;j<9;j++)
{
if(ss[i][j]=='0')
{
for (n=0;n<9;n++)
{
dict[n] = n+'1';
}
formathengshu(i,j);
formatxiaofangge(i,j);
cCount=0;
for (n=0;n<9;n++)
{
if('0' != dict[n])
{
++cCount ;
}
}
if(min>cCount)
{
min = cCount;
min_m = i*9+j;
memcpy(tmpdict,dict,9);
}
}
}
}
if((81!=min_m))
{
for(n=0;n<9;n++)
{
if( tmpdict[n]!='0')
{
i=min_m/9;
j=min_m%9;
ss[i][j] = tmpdict[n];
if(0!=sort())
ss[i][j] ='0';
else
return 0;//成功
}
}
}
else
{
// getchar();
printf("\n\n\n");
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
printf("%c ",ss[i][j]);
}
printf("\n");
}
printf("\n\n\n");
return 1;/* 0就生成一个解 1多个解 */
}
return 1;
}
char ddd[9];
void check()
{
int i =0;
int j=0;
for (i=0;i<9;i++)
{
memset(ddd,0,9);
for (j=0;j<9;j++)
{
if (ss[i][j] != '0')
if (ddd[ss[i][j]-'0'-1] == 0)
{
ddd[ss[i][j]-'0'-1] =ss[i][j];
}
else
{
printf("%d %d\n",i,j);
}
}
}
for (j=0;j<9;j++)
{
memset(ddd,0,9);
for (i=0;i<9;i++)
{
if (ss[i][j] != '0')
if (ddd[ss[i][j]-'0'-1] == 0)
{
ddd[ss[i][j]-'0'-1] =ss[i][j];
}
else
{
printf("%d %d\n",i,j);
}
}
}
memset(ddd,0,9);
for (i=0;i<3;i++)
{
for (j=0;j<3;j++)
{
if (ss[i][j] != '0')
if (ddd[ss[i][j]-'0'-1] == 0)
{
ddd[ss[i][j]-'0'-1] =ss[i][j];
}
else
{
printf("%d %d\n",i,j);
}
}
}
memset(ddd,0,9);
for (i=0;i<3;i++)
{
for (j=3;j<6;j++)
{
if (ss[i][j] != '0')
{
if (ddd[ss[i][j]-'0'-1] == 0)
{
ddd[ss[i][j]-'0'-1] =ss[i][j];
}
else
{
printf("%d %d\n",i,j);
}
}
}
}
memset(ddd,0,9);
for (i=0;i<3;i++)
{
for (j=6;j<9;j++)
{
if (ss[i][j] != '0')
{
if (ddd[ss[i][j]-'0'-1] == 0)
{
ddd[ss[i][j]-'0'-1] =ss[i][j];
}
else
{
printf("%d %d\n",i,j);
}
}
}
}
memset(ddd,0,9);
for (i=3;i<6;i++)
{
for (j=0;j<3;j++)
{
if (ss[i][j] != '0')
if (ddd[ss[i][j]-'0'-1] == 0)
{
ddd[ss[i][j]-'0'-1] =ss[i][j];
}
else
{
printf("%d %d\n",i,j);
}
}
}
memset(ddd,0,9);
for (i=3;i<6;i++)
{
for (j=3;j<6;j++)
{
if (ss[i][j] != '0')
{
if (ddd[ss[i][j]-'0'-1] == 0)
{
ddd[ss[i][j]-'0'-1] =ss[i][j];
}
else
{
printf("%d %d\n",i,j);
}
}
}
}
memset(ddd,0,9);
for (i=3;i<6;i++)
{
for (j=6;j<9;j++)
{
if (ss[i][j] != '0')
{
if (ddd[ss[i][j]-'0'-1] == 0)
{
ddd[ss[i][j]-'0'-1] =ss[i][j];
}
else
{
printf("%d %d\n",i,j);
}
}
}
}
memset(ddd,0,9);
for (i=6;i<9;i++)
{
for (j=0;j<3;j++)
{
if (ss[i][j] != '0')
if (ddd[ss[i][j]-'0'-1] == 0)
{
ddd[ss[i][j]-'0'-1] =ss[i][j];
}
else
{
printf("%d %d\n",i,j);
}
}
}
memset(ddd,0,9);
for (i=6;i<9;i++)
{
for (j=3;j<6;j++)
{
if (ss[i][j] != '0')
{
if (ddd[ss[i][j]-'0'-1] == 0)
{
ddd[ss[i][j]-'0'-1] =ss[i][j];
}
else
{
printf("%d %d\n",i,j);
}
}
}
}
memset(ddd,0,9);
for (i=6;i<9;i++)
{
for (j=6;j<9;j++)
{
if (ss[i][j] != '0')
{
if (ddd[ss[i][j]-'0'-1] == 0)
{
ddd[ss[i][j]-'0'-1] =ss[i][j];
}
else
{
printf("%d %d\n",i,j);
}
}
}
}
}
int main(void)
{
check();
// (void)sort();
return 0;
}
一种栈
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int suduku[81];
int tempNum[81];
int tempSp=-1;
int startH[81];
int startV[81];
int startB[81];
int addH[9];
int addV[9];
int addB[9];
int init()
{
int i;
for(i=0;i<81;i++)
{
startH[i]=i/9*9;
startV[i]=i%9;
startB[i]=((i/9)/3)*27+((i%9)/3)*3;
}
for(i=0;i<9;i++)
{
addH[i]=i;
addV[i]=i*9;
addB[i]=(i/3)*9+(i%3);
}
}
int printSudoku(int *prn)
{
int i;
for(i=0;i<81;i++)
{
printf("%2d",prn[i]);
if(i%9==8)
printf("\n");
}
}
int tryAns()
{
int sp=getNextBlank(-1);//取得第一个位置填入数字
do
{
suduku[sp]++; //将本位置数字加一
if(suduku[sp]>9)
{
suduku[sp]=0;
sp=pop();
}
else
{
if(check(sp)==0)
{
push(sp);
sp=getNextBlank(sp);
}
}
}while(sp>=0&&sp<81);
}
int getNextBlank(int sp)
{
do
{
sp++;
} while(sp<81&&suduku[sp]>0);
return sp;
}
int check(int sp)
{
int fg=0;
if(!fg)
fg=check1(sp,startH[sp],addH);
if(!fg)
fg=check1(sp,startV[sp],addV);
if(!fg)
fg=check1(sp,startB[sp],addB);
return fg;
}
int check1(int sp,int start,int *addnum)
{
int fg=0,i,sp1;
for(i=0;i<9;i++)
{
sp1 = start + addnum[i];
if(sp!=sp1&&suduku[sp]==suduku[sp1])
fg++;
}
return fg;
}
int push(int sp)
{
tempNum[tempSp++] = sp;
}
int pop()
{
if(tempSp<0)
return -1;
else
return tempNum[--tempSp];
}
int main(int argc,char *argv[])
{
int j;
if(argc>1)
for(j=0;j<81;j++)
suduku[j]=argv[1][j]-'0';
printf("---------------------------\n");
printSudoku(suduku);
init();
tryAns();
printf("---------------------------\n");
printSudoku(suduku);
printf("---------------------------\n");
return 0;
}