Codeforces 888D： Almost Identity Permutations（错排公式，组合数）

A permutation \(p\) of size \(n\) is an array such that every integer from \(1\) to \(n\) occurs exactly once in this array.html Let's call a permutation an almost identity permutation iff there exist

>>阅读原文<<