锐客网

  1. 首页 > it技术 > >

UVa, 11000 Bee

recurrences

Problem A: Bee

The Problem 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!
【UVa, 11000 Bee】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.

The Input Each line of input contains an integer N (≥ 0). Input ends with a case where N = -1. (This case should NOT be processed.)
The 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 232.)
Sample Input
1 3 -1


Sample Output
1 2 4 7


#include int main() { int i,n; long long a, b,c,d; while(scanf("%d",&n)!=EOF) { if(n==-1) { break; } a=1; b=0; for(i=0; i

    推荐阅读


      上一篇：Deepin下docker使用

      下一篇：从Git版本控制中删除文件