acm竞赛题目迭代蜜蜂

Bee

Time Limit: 3000ms, Memory Limit: 10000KB , Accepted: 2967, Total Submissions: 3722

Description

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.

Input

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

Output

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

• Sample Input 

  1
  3
  -1

• Sample Output

  1 2
  4 7

#include<stdio.h>
int fun(int n);
int g(int n);
int main()
{
int n,i=1,j,k,f,m,a[100],x;
while(1)
{
scanf("%d",&a[i]);
if(a[i]==-1)break;
i++;
}
for(j=1;j<i;j++)
{
n=a[j];
printf("%d %d\n",g(n-1),g(n));
}
}

int fun(int n)
{
if(n==1)return 1;
if(n>=2)return g(n-1);
}

int g(int n)
{
if(n==0)return 1;
if(n==1)return 2;
if(n>=2)return fun(n-1)+g(n-1)+1;
}