Bee(UVA11000)

Description

In Africa there is a very special species of bee. Every year, the female bees of such species give birthto 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 effectthat she is immortal, but still able to give birth once a year as all the other female bees. The scientistswould like to know how many bees there will be after N years. Please write a program that helps themfind the number of male bees and the total number of all bees after N years.

Input

Each line of input contains an integer N (≥ 0). Input ends with a case where N = −1. (This caseshould NOT be processed.)

Output

Each line of output should have two numbers, the first one being the number of male bees after Nyears, and the second one being the total number of bees after N years. (The two numbers will notexceed 2^32.)

Sample Input

1

3

-1

Sample Output

1 2

4 7

思路

这就是一个简单的递归问题
雌蜂的数量是上一年雄蜂的数量+1，雄蜂的数量是上一年的总数。

AC代码

#include<iostream>
using namespace std;
int main(){
long long int f,m ,a;//雌蜂的数量，雄峰的数量，总数量
long long int n;
while(cin>>n&&n!=-1){
        f=1,m = 0,a=0;
    for(long long int i = 0;i<=n;i++){
        f = m+1;
        m = a;
        a = f+m;
    }
    cout<<m<<" "<<a<<endl;
}
return 0;
}