Description: Latin matrix problem: Existing N different shapes of stones, each gem has enough teeth. The stones are arranged in a matrix wishing m rows and n columns, m < = n, the matrix so that each row and each column do not have the same shape as the jewel. Try to design an algorithm to calculate for a given m and n, there are many different kinds of gems arranged plan. Algorithm Design: For a given m and n, the program calculates the number of different permutations gems.
To Search:
File list (Check if you may need any files):
lading\input.txt
......\lading.cpp
......\output.txt
lading
Download