hdu 1021

Fibonacci Again

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

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

 

Author

Leojay

 

Recommend

JGShining

 

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