杭电 1021 找规律

    实在写不下去题了，，，水题开始。。。。。题目：

Fibonacci Again

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

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

 

ac代码：

#include <iostream>
#include <cstdio>
using namespace std;
int main(){
 int n;
 while(~scanf("%d",&n)){
   if((n-2)%4==0)
       printf("yes\n");
   else
       printf("no\n");
 }
  return 0;
}

转载于:https://www.cnblogs.com/javaspring/archive/2011/11/25/2656427.html