设计算法解决拉丁矩阵问题，将n种不同形状的宝石排列成m行n列的一个矩阵，每一行每一列的宝石都没有相同形状，求宝石排列方案数(Latin matrix design algorithm to solve the problem, the gem n different shapes arranged in m rows n columns of a matrix, each row of each column of gems don't have the same shape, strives