Calculation of the number of complete mappings for permutations

The computation time for counting “good” permutations rapidly grows as the length of permutations increases. The paper presents algorithms for enumeration of “good” permutations. Algorithms reducing twice the number of “good” permutations that should be counted are considered along with the algorithm employing the concept of weight of a “good” permutation. Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 106–110, March–April, 2000.