容斥原理
说的是一种计数方式,使得每种情况只被记一次。
∑ i = 1 n C n i ( − 1 ) i + 1 = [ n ≥ 1 ] \sum_{i=1}^{n}C_n^i(-1)^{i+1}=[n\geq 1] ∑i=1nCni(−1)i+1=[n≥1]
入门例题
(1) HDU 1465 \text{(1) HDU 1465} (1) HDU 1465
错排问题模板题。
推一下递推式子:
把 n n n个 i ̸ = a i i\not = a_i i̸=ai当成 n n n个条件然后容斥,每次选一些不错位,剩下随便排.
d p [ n ] = ∑ i = 0 n ( − 1 ) i + 1 C n i ( n − i ) ! dp[n]=\sum_{i=0}^n (-1)^{i+1}C_{n}^{i}(n-i)! dp[n]=∑i=0n(−1)i+1Cni(n−i)!
d p [ n ] = ∑ i = 0 n ( − 1 ) i + 1 n ! i ! ( n − i ) ! ( n − i ) ! dp[n]=\sum_{i=0}^n (-1)^{i+1}\frac{n!}{i!(n-i)!}(n-i)! dp[n]=∑i=0n(−1)i+1i!(n−i)!n!(n−i)!
d p [ n ] = ∑ i = 0 n ( − 1 ) i + 1 n ! i ! dp[n]=\sum_{i=0}^n (-1)^{i+1}\frac{n!}{i!} dp[n]=∑i=0n(−1)i+1i!n!
d p [ n ] = ( − 1 ) n + ∑ i = 0 n − 1 ( − 1 ) i + 1 n ! i ! dp[n]=(-1)^n+\sum_{i=0}^{n-1} (-1)^{i+1}\frac{n!}{i!} dp[n]=(−1)n+∑i=0n−1(−1)i+1i!n!
d p [ n ] = ( − 1 ) n + n ∑ i = 0 n − 1 ( − 1 ) i + 1 ( n − 1 ) ! i ! dp[n]=(-1)^n+n\sum_{i=0}^{n-1} (-1)^{i+1}\frac{(n-1)!}{i!} dp[n]=(−1)n+n∑i=0n−1(−1)i+1i!(n−1)!
d p [ n ] = ( − 1 ) n + n    d p [ n − 1 ] dp[n]=(-1)^n+n \;dp[n-1] dp[n]=(−1)n+ndp[n−1]
#include <cstdio>
long long dp[21];
int main()