递推(部分题型公式)

1.分割平面

    //直线分割平面
	f[n] = f[n - 1] + n;
	f[n] = ((n + 1) * n) / 2 + 1;

	//两条直线分割平面
	f[n] = f[n - 1] + 4 * n - 1;
	f[n] = 2 * n * n + n + 1;

	//折线分割平面
	f[n] = f[n - 1] + 4 * n - 3;
	f[n] = 2 * n * n - n + 1;

	//Z形曲线分割
	f[n] = f[n - 1] + 9 * n - 8;

2.错排公式  D[n] = (n-1)*(D[n-1] + D[n-2])

    long long a[55];
    a[1] = 0, a[2] = 1;
    for (int i = 3; i <= 20; i++)
    {
        a[i] = (a[i - 1] + a[i - 2]) * (i - 1);
    }

3.排列组合公式   求C(n,m)组合数   n!/(m!*(n-m)!)

   //从n中取m
    切记c[0]必须为1
    long long c[55];
    c[0] = 1, c[1] = 1, c[2] = 2;
    for (int i = 3; i <= 20; i++)
    {
        c[i] = c[i - 1] * i;
    }
    long long f = (c[m] / (c[n] * c[m - n]));

4.立体切东西   最多块数是   (n^3+5n+6)/6

    int n;
    int f = (n * n * n + 5 * n + 6) / 6;