首页 > itarticle > uva 12459 – bees’ ancestors

uva 12459 – bees’ ancestors

admin 11月 12, 2020 0

Contents

Problem

題目網址
中文網址

Solution

費氏數列：

M:male, F:female

Both male and female need a mom: F(n) = F(n-1) + M(n-1)
Only female need a dad: M(n) = F(n-1)
F(n) = F(n-1) + F(n-2)

n generation:
M(n) + F(n) = F(n-1) + F(n)

Code

UVa 12459
1
2
3
4
5
6
7
8
9
10
11
12
13
 

int ()
{
    long long fib[81] = {1, 1};
    int n;
    for (int i = 2; i < 81; i++)
        fib[i] = fib[i - 1] + fib[i - 2];

    while (scanf("%d", &n) && n)    
        printf("%lldn",fib[n]);
    
    return 0;
}
微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能