首页 > 代码库 > hdu 1021
hdu 1021
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.
Print the word "no" if not.
Sample Input
012345
Sample Output
nonoyesnonono
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>
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。