UVA-11000

UVA 11000

题目简介：
In Africa there is a very special species of bee. Every year, the female bees of such species give birth
to one male bee, while the male bees give birth to one male bee and one female bee, and then they die!
Now scientists have accidentally found one “magical female bee” of such special species to the effect
that she is immortal, but still able to give birth once a year as all the other female bees. The scientists
would like to know how many bees there will be after N years. Please write a program that helps them
find the number of male bees and the total number of all bees after N years.

大意：
有一只不死的雌蜂，雌蜂1年生1只雄峰，雄峰1年生一只雌蜂和一只雄峰。除了那只不死的雌蜂，其他的在生完后死去。
不死的雌蜂另外算，设第i-1年有X只雄峰，Y只雌蜂，那么，1年后，雄风个数为X+Y+1，雌蜂为X。

AC代码：

#include<iostream>
#include<cstring>
#include<climits>
using namespace std;

typedef long long LL;
LL Maxn=LL(INT_MAX)+5;
LL ss[1000000][2];

int main(){
	ss[0][0]=ss[0][1]=0;
	for(int i=1;;i++){
		ss[i][0]=ss[i-1][0]+ss[i-1][1]+1;
		ss[i][1]=ss[i-1][0];
		if(ss[i][0]+ss[i][1]>Maxn)break;
	}
	int n;
	while(scanf("%d",&n)&&n!=-1){
		LL ans=0;
		ans=ans+ss[n][0]+ss[n][1]+1;
		cout<<ss[n][0]<<' '<<ans<<endl;
	}
	return 0;
}