HDU_1021 Fibonacci Again

Fibonacci Again

[align=left]Problem Description[/align]
There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).

 

 
[align=left]Input[/align]
Input consists of a sequence of lines, each containing an integer n. (n < 1,000,000).

 

 
[align=left]Output[/align]
Print the word "yes" if 3 divide evenly into F(n).

Print the word "no" if not.

 

 
[align=left]Sample Input[/align]

0
1
2
3
4
5

 

 
[align=left]Sample Output[/align]

no
no
yes
no
no
no

 

#include<stdio.h>
#define MAX 1000000+10
int a[MAX]={1,2};
void count()
{
for(int i=2;i<=MAX;i++)
{
a[i]=(a[i-1]+a[i-2])%3;
}
}
int main()
{
count();
int n;
while(~scanf("%d",&n))
{
if(!a
)   printf("yes\n");
else printf("no\n");
}
return 0;
}