母牛生小牛.cpp

这是个关于母牛生小牛的简单算法,可供大家借鉴哦.

/*#include<iostream>
using namespace std;
int f(int N)
{
	int a;
    if(N==1)
		a=1;
	else if(N==2)
		a=1;
	else if(N==3)
		a=1;
    else if(N>=4&&N<=50)
		a=f(N-1)+f(N-3);
	else
	    cout<<"data error!"<<endl;
	return(a);
}
int main()
{
    int f(int N);
	int y,N;
	while(cin>>N)
	{
	y=f(N);
	cout<<y<<endl;
	}
	return 0;
}*/



#include<iostream>
using namespace std;
int main ()
{
    int N,p;
	while(cin>>N)
	{
		int a1=1,a2=1,a3=1;
		if((N-1)*(N-2)*(N-3)==0)
			cout<<a1<<endl;
		else
		{
		  for (int i=4;i<=N;i++)
		  {
			p=a1;
			a1=a2;
			a2=a3;
			a3=p+a3;
		  }
		  cout <<a3<<endl;
		}
	}
	return 0;
}