HDU 1021 Fibonacci Again

Fibonacci Again

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 51358    Accepted Submission(s): 24305

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

012345

 

Sample Output

nonoyesnonono

这道题目其实不用按着他的思路给绕进去，找张纸，然后分析会发现出规律，若余数等于2或者余数等于6时，就能够给3整除，因此代码就变得非常简单了！

#include<iostream>using namespace std;int main(){int n;while(cin>>n){if(n%8==2||n%8==6)cout<<"yes"<<endl;else cout<<"no"<<endl;} }