摘要：
Basic and obvious exact cover problem, using Dancing Links Algorithm (DLX).DLX reference: Dancing Links.pdf#include <stdio.h>const int MAXM = 20;const int MAXN = 400;int U[MAXM*MAXN], D[MAXM*MAXN], L[MAXM*MAXN], R[MAXM*MAXN], C[MAXM*MAXN], X[MAXM*MAXN];int H[MAXM], S[MAXN], Q[MAXM];int size, n 阅读全文