标签：数学 acm 杭电
Fibonacci Again
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 36384 Accepted Submission(s): 17575
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
Sample Output
Author
Leojay
找规律题：
f(n)依次是7,11,18,29,47,76,123,199,
322,521,843,1364,2207，3571,5778,9349
除以三时候分别是 1,2,0,2,2,1,0,1
1,2,0,2,2,1,0,1
周期是八 一般的计算方法就会超时
<span style="font-size:24px;">#include<stdio.h>
int main()
{
int n;
while(~scanf("%d",&n))
{
if(n%4==2)
printf("yes\n");
else
printf("no\n");
}
return 0;
}</span>
hdu 1021,布布扣,bubuko.com
hdu 1021
标签：数学 acm 杭电
原文地址：http://blog.csdn.net/ice_alone/article/details/38365153
