zoukankan      html  css  js  c++  java
  • ACM Bee

    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 232.) Sample Input

    1

    3

    -1

    Sample Output

    1 2

    4 7

    参考博客:

    http://blog.csdn.net/tower13/article/details/51064619

    /*
        参考:
         http://blog.csdn.net/tower13/article/details/51064619    
    */
    #include<stdio.h>
    int main()
    {
        long long int n;
        while(~scanf("%lld",&n)&&n != -1){
            long long int sum = 1 ,w = 1,m = 0,temp1;
            for(long long int i = 1;i <= n; i++)
            {
                temp1 = w;
                w = m+1;           //雌蜂数量 = 上一年的雄蜂+1    
                m = temp1 + m;  //雄蜂数量 =  上一年的雌蜂+雄蜂
                    
            } 
            printf("%lld %lld
    ",m,w+m);        
    }    
    return 0;
    }
  • 相关阅读:
    Linux命令大全之关机重启命令
    Linux命令大全之帮助命令及压缩命令
    Linux命令大全之搜索命令
    Linux命令大全之基本命令
    Linux安装界面简介
    Linux 的ftp服务未启用怎么办
    创建分区表
    Linux分区,格式化概念理解
    VMware简介
    Linux简介
  • 原文地址:https://www.cnblogs.com/jj81/p/7197722.html
Copyright © 2011-2022 走看看