hdu1021 Fibonacci Again 找规律 水题

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1021

 

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

0

1

2

3 4

5

Sample Output

no

no

yes

no

no

no

 

手写 前10个数，你就会发现每隔4个数就会出现一个mod3的数，而且我们知道各个数位上的和能被3整除，那么就能被3整除这个基本规律，我们可以大胆的猜测n%4==2

#include<iostream>
#include<cstdio>
using namespace std;

int main(){
    int n;
    while(~scanf("%d",&n))
        if(n%4==2)
            printf("yes\n");
        else
            printf("no\n");

	return 0;
}

 

import java.util.Scanner;

public class hdu1021_Fibonacci_Again {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n;
		while(in.hasNext()) {
			n = in.nextInt();
			if(n%4==2)
				System.out.println("yes");
			else
				System.out.println("no");
		}
	}

}