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
0
1
2
3
4
5

Sample Output
no
no
yes
no
no
no
建立数组逐个循环求出输入数字的值
这一步注意后来的值可能越界，需要一边计算一边%
注意考虑 a【0】和 a【1】的特殊性 需要单独修改
因为数组过大 需要全局变量
代码如下
#include<stdio.h>
int a[1000005];
int main()
{
a[0] = 7;
a[1] = 11;
int n;
for(int i=2;i<1000005;i++){
a[i] = (a[i-1] + a[i-2])%3;
}
a[0]=1;
a[1]=2;
while(scanf("%d",&n)!=EOF){
if(a[n]==0){
printf(“yes\n”);
}
else {
printf(“no\n”);
}
}
return 0;
}