ZOJ Problem Set - 2060
Fibonacci Again
Time Limit: 2 Seconds Memory Limit: 65536 KB
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 Outpu
ZOJ-2060 Fibonacci Again(斐波那契找规律,水题)
最新推荐文章于 2020-01-27 10:07:07 发布
该博客介绍了ZOJ 2060题目,涉及一个特殊的斐波那契数列,其中F(0)=7, F(1)=11, 并通过递推公式F(n)=F(n-1)+F(n-2)计算后续项。文章要求判断给定的n是否使得3能整除F(n),并通过样例展示了输出结果。博主建议通过观察数列规律来解决此问题。"
114717942,10538474,Java Web:SAX与STAX的推拉模型解析XML实战,"['Java Web', 'XML解析', 'SAX', 'STAX', '事件驱动']
摘要由CSDN通过智能技术生成