HDU 1021 Fibonacci Again

最新推荐文章于 2024-07-25 21:08:56 发布

原创最新推荐文章于 2024-07-25 21:08:56 发布 · 222 阅读

0 ·

CC 4.0 BY-SA版权

OJ 专栏收录该内容

27 篇文章

订阅专栏

本文介绍了一种特殊的斐波那契数列，其中F(0)=7且F(1)=11，并通过Java程序判断该数列中任意项是否能被3整除。输入为一系列整数n，输出表明F(n)是否可以被3整除。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

no
no
yes
no
no
no

Code

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            int x = sc.nextInt();
            switch (x % 4) {
            case 0:
            case 1:
            case 3:
                System.out.println("no");
                break;
            case 2:
                System.out.println("yes");
                break;
            default:
                break;
            }
        }
        sc.close();
    }
}