C++ 生牛递归问题

#include <iostream>


int cowSum(int n);
int cowSumPro(int n);


int main()
{
for (int i = 0; i < 50; ++i)
{
std::cout << cowSum(i) << " ";
std::cout << cowSumPro(i);
std::cout << std::endl;
}


system("pause");
return 0;
}


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


int cowSumPro(int n)
{
if (n == 0 || n == 1 || n == 2 || n == 3)
{
return n;
}


int res = 3;
int pre = 2;
int prepre = 1;


int tmp1 = 0;
int tmp2 = 0;
for (int i = 4; i <= n; ++i)
{
tmp1 = pre;
tmp2 = res;
res += prepre;
prepre = tmp1;
pre = tmp2;
}
return res;
}