HDU 1021 Fibonacci Again

 

Fibonacci Again

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

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

解题：

      题目意思：一组数，要求其中某个是否能被3整除

      刚开始时是想用打表，可是发现不行，后来用发现规律，从第二个开始，每隔四个都可以被3整除。

#include "stdio.h"
#define MAX 250000
int main()
{
	int F[MAX];
	int i,n;
	F[0]=2;
	for (i=1;i<MAX;i++)
	{
		F[i]=F[i-1]+4;
	}
	while (scanf("%d",&n)!=EOF)
	{
		for (i=0;i<MAX;i++)
		{
			if (n==F[i])
			{
				break;
			}
		}
		if (i==MAX)
		{
			printf("no/n");
		}
		else
			printf("yes/n");
	}
	return 0;
}