类斐波那契数列问题
#include <iostream>
using namespace std;
void main(void)
{
int cow=1, year=1,addCow=0,dieCow[15],countCow[21]={0,2,3,4};
for(int i=0;i<15;i++) //初始化每年死的母牛;
dieCow[i]=0;
for(int j=4;j<=20;j++) //初始化第几年的母牛总数;
countCow[i]=0;
for(year=4;year<=20;year++)
{
if(year<16)
countCow[year]=countCow[year-3]+countCow[year-1];
else
countCow[year]=countCow[year-3]+countCow[year-1]-countCow[year-15];
}
for(int k=1;k<=20;k++)
{
if(k<16)
cout<<"第"<<k<<"年死去的母牛数为:"<<dieCow[k]<<";";
else
cout<<"第"<<k<<"年死去的母牛数为:"<<countCow[k-15]<<";";
cout<<"第"<<k<<"年的母牛总数为:"<<countCow[k]<<endl;
}
}本文出自 “Life Track” 博客,请务必保留此出处http://pauloy.blog.51cto.com/186789/93825