HDU -&gt; acm -&gt;Fibonacci Again

最新推荐文章于 2021-03-30 20:32:20 发布

gonbe5

最新推荐文章于 2021-03-30 20:32:20 发布

阅读量109

点赞数

本文链接：https://blog.csdn.net/desporado/article/details/79765449

版权

Fibonacci Again

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 32216 Accepted Submission(s): 15569

Problem Description

There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).

Input

Input consists of a sequence of lines, each containing an integer n. (n < 1,000,000).

Output

Print the word "yes" if 3 divide evenly into F(n).

Print the word "no" if not.

Sample Input

Sample Output

yes

一开始做这道题目时以为就是简单的递归运用，就直接开始码代码，没有考虑数据溢出问题：

#include <stdio.h>
#include <stdlib.h>
int test(int n)
{
    if(n == 1) return 11;
    if(n == 0) return 7;
    return (test(n - 1) + test(n - 2));
}
int main()
{
    int n;
    while(scanf("%d", &n) != EOF)
    {
        if(test(n) % 3 == 0)
        {
            printf("yes\n");
        }
        else printf("no\n");
    }
    return 0;
}

同样的提交后出现的问题，思考后发现：当N足够大的时候程序会超出负载报错，

这也是递归题常用的套路，那么它必定有规律可循！当你在纸上仔细列几个数以

后发现：从第二个数开始每四个数就会出现一个能被3整除的！

找到规律后就容易的多了：

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int n;
    while(scanf("%d", &n) != EOF)
    {
        if(n % 4 == 2)
        {
            printf("yes\n");
        }
        else printf("no\n");
    }
    return 0;
}