N年后奶牛的数量

题目
假设农场中成熟的母牛每年只会生1头小母牛，并且永远不会死。第一年农场只有一只成熟的母牛，从第二年开始生小母牛。每只小母牛三年之后成熟又可以生小母牛。给定整数N，求N年后的数量。

递归实现 O(n2)

  int c1(int n)
    {
    	if (n < 1)
    		return 0;
    	if (n == 1 || n == 2 || n == 3)
    		return n;
        return c1(n - 1) + c1(n - 3);
    }

依次实现 O(n)

int c2(int n)
{
	if (n < 1)
		return 0;
	if (n == 1 || n == 2 || n == 3)
		return n;

	int a = 1;
	int b = 2;
	int c = 3;
	int tmp1 = 0;
	int tmp2 = 0;
	for (int i = 4; i <= n; i++)
	{
		tmp1 = c;
		tmp2 = b;
		c = c + a;
		a = tmp2;
		b = tmp1;
	}
	return c;
}

矩阵乘法实现 时间复杂度O（logn）

C(n) = C(n - 1) + C(n-3)
(Cn, Cn - 1, Cn - 2) = (C3, C2, C1){ { a, b, c }, { d, e, f }, {g, h, i} }n-3
f(1) = 1 f(2) = 2 f(3) = 3 f(4) = 4 f(5) = 6
4, 3, 2 = 3, 2, 1 * {{ a, b, c }, { d, e, f }, { g, h, i } }
3a + 2d + g = 4
3b + 2e + h = 3
3c + 2f + i = 2
{{ a, b, c }, { d, e, f }, { g, h, i } } = { { 1, 1, 0 }, { 0, 0, 1 }, { 1, 0, 0 } }
(Cn, Cn - 1, Cn - 2) = (3, 2, 1){ { 1, 1, 0 }, { 0, 0, 1 }, { 1, 0, 0 } }n - 3次方

int c3(int n)
{
	if (n < 1)
		return 0;
	if (n == 1 || n == 2 || n == 3)
		return n;

	vector<vector<int>> base = { { 1, 1, 0 }, { 0, 0, 1 }, {1, 0, 0} };
	vector<vector<int>> res = matrixPoew(base, n - 3);
	return 3 * res[0][0] + 2 * res[1][0] + res[2][0];
}

vector<vector<int>> muliMatrix(vector<vector<int>>&m1, vector<vector<int>>&m2)
{
	vector<vector<int>> res (m1.size(), vector<int>(m2[0].size(), 0));
	for (int i = 0; i < res.size(); i++)
	{
		for (int j = 0; j < res[0].size(); j++)
		{
			for (int k = 0; k < m2.size(); k++)
			{
				res[i][j] += m1[i][k] * m2[k][j];
			}
		}
	}

	return res;
}

vector<vector<int>> matrixPoew(vector<vector<int>>&m, int power)
{
	vector<vector<int>> res(m.size(), vector<int>(m[0].size(), 0));
	for (int i = 0; i < res.size(); i++)
	{
		res[i][i] = 1;
	}

	vector<vector<int>> tmp = m;
	for (; power != 0; power >>= 1)
	{
		if (power & 1)
		{
			res = muliMatrix(res, tmp);
		}
		tmp = muliMatrix(tmp, tmp);
	}

	return res;
}