HODJ 1021 Fibonacci Again

Fibonacci Again

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

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

 

代码：

// Title : Fibonacci Again
// Addr : http://acm.hdu.edu.cn/showproblem.php?pid=1021
// Date : 2013-12-26 21:41:16

#include <iostream>
using namespace std;

int main()
{
	int a, b, n;
	int flag = 0;
	int temp;
	while(cin >> n)
	{
		a = 4;
		b = 2;
		flag = 0;
		if(n == 1 || n == 0)
			flag = 0;
		for(int i = 2; i <= n; i++)
		{
			temp = a + b;
			a = b;
			b = temp;
			while(b > 9)
			{
				temp = b;
				b = 0;
				while(temp)
				{
					b += temp % 10;
					temp /= 10;
				}
			}
		}
		if(b % 3 == 0)
			flag = 1;
		if(flag == 1)
			cout << "yes" << endl;
		else
			cout << "no" << endl;
	}

	return 0;
}