hdoj.1021 Fibonacci Again 20140725

Fibonacci Again

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 36271 Accepted Submission(s): 17517



[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 [code]#include<stdio.h>
int p[1000010];
int main()
{
int n,i;
p[0]=1;p[1]=2;
for(i=2;i<1000000;i++)  p[i]=(p[i-1]+p[i-2])%3;
while(scanf("%d",&n)!=EOF){
if(!p
) printf("yes\n");
else printf("no\n");
}
return 0;
}

[/code]