HDU 1465 (容斥)

题目连接

利用容斥解题

大神代码

https://www.cnblogs.com/cmmdc/p/7220331.html

组合数 ：Number[ i ][ j ] i个里面选j个   = Number[ i - 1 ] [ j ] + Number[ i - 1 ][ j - 1 ].  

AC：代码

#include<iostream>
#include<cstring>
#include<string.h>
using namespace std;
const int maxn = 25;
typedef long long LL;
LL Ans[maxn]; //Ans[n]表示 n个 信封错排的所有情况
LL Number[maxn + 5][maxn + 5]; //Number[i][j]  求组合数， 从i中抽取 j个 
void Solve(){
	Ans[1] = 0;
	Ans[2] = 1;
	Ans[3] = 2;
	Number[3][1] = 3;
	Number[3][2] = 3;
	Number[3][3] = 1;
	Number[3][0] = 1;
	LL sum = 6;
	for(int i = 4; i <= maxn; i++){
		sum *= i;
		Ans[i] = sum;
		for(int j = 1; j < i; j++){
			Number[i][j] = Number[i-1][j] + Number[i-1][j-1];
			Ans[i] = Ans[i] - Ans[j] * Number[i][j];
		}
		Ans[i] -= 1;
		Number[i][i] = 1;
		Number[i][1] = i;
	}
}
int main(){
	int n; 
	Solve();
	while(~scanf("%d", &n)){
		printf("%lld\n", Ans[n]);
	} 
	return 0;
}