HDU1021

来源:互联网 发布:阿里云怎么打开iis 编辑:程序博客网 时间:2024/05/17 21:46

Fibonacci Again



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
//HDU1021 基础题//Fibonacci Again//2017.05.25 by wyj#includeusing namespace std;int main(){int n;while (cin >> n){if ((n - 2) % 4 == 0)cout << "yes" << endl;elsecout << "no" << endl;}return 0;}