最好数独算法c语言,分享码好的数独

该楼层疑似违规已被系统折叠 隐藏此楼查看此楼

#include

#include

#define O 3

#define DIM (O*O)

int nodupes(int a[DIM]) {

int hits[DIM];

int i;

for(i=0;i

for(i=0;i

if(a[i]!=0) {

if(hits[a[i]-1]>0)

return 0;

hits[a[i]-1]++;

}

}

return 1;

}

int *estrai_riga(int m[DIM][DIM], int riga) {

int *ritorno=malloc(sizeof(int)*DIM);

int i;

for(i=0;i

ritorno[i] = m[riga][i];

return ritorno;

}

int *estrai_riquadro(int m[DIM][DIM],

int x, int y) {

int *ritorno=malloc(sizeof(int)*DIM);

int i,j,h=0;

for(i=0;i

for(j=0;j

ritorno[h++] = m[x+i][y+j];

return ritorno;

}

int *estrai_colonna(int m[DIM][DIM],

int colonna) {

int *ritorno=malloc(sizeof(int)*DIM);

int i;

for(i=0;i

ritorno[i] = m[i][colonna];

return ritorno;

}

int corretto(int m[DIM][DIM]) {

// verifica che le righe siano corrette

int i, j;

for(i=0;i

if (!nodupes(estrai_riga(m, i)))

return 0;

}

for(i=0;i

if (!nodupes(estrai_colonna(m, i)))

return 0;

}

for(i=0;i

if (!nodupes(estrai_colonna(m, i)))

return 0;

}

for(i=0;i

for(j=0;j

if(!nodupes(estrai_riquadro(m,i*O,j*O)))

return 0;

return 1;

}

int *prima_libera(int m[DIM][DIM]) {

int i, j;

for(i=0;i

for(j=0;j

if(m[i][j]==0)

{

return &(m[i][j]);

}

return NULL;

}

int risolvi(int m[DIM][DIM]) {

int *p, i;

if(corretto(m)==0)

return 0;

p = prima_libera(m);

if(p==NULL) {

return 1;

}

for(i=1;i<=DIM;i++) {

*p = i;

if(risolvi(m)==1) return 1;

}

*p = 0;

return 0;

}

void stampa_m(int m[DIM][DIM]) {

int i,j;

for(i=0;i

for(j=0;j

printf("%i\t", m[i][j]);

}

printf("\n");

}

}

int main() {

int *p;

int m[DIM][DIM] = {

{6,0,0,2,0,0,0,9,0},

{0,1,0,0,9,0,0,0,2},

{0,0,7,0,0,3,0,0,0},

{2,0,0,6,0,0,3,0,0},

{0,4,0,0,8,0,0,7,0},

{0,0,5,0,0,4,0,0,1},

{0,0,0,7,0,0,5,0,0},

{8,0,0,0,5,0,0,6,0},

{0,3,0,0,0,1,0,0,9},

};

stampa_m(m);

printf("\n");

risolvi(m);

stampa_m(m);

return 0;

}