hdu 1021 Fibonacci Again
2016-04-11 00:31
405 查看
Fibonacci Again
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 50368 Accepted Submission(s): 23858
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
Author
Leojay
学好英文很重要,就是问你这个数列的第n项是否可以被3整除;
#include<iostream> #include<cstdio> using namespace std; int ans[1000000]; int main() { ans[0]=7; ans[1]=11; for(int i=2;i<1000000;++i) { ans[i]=(ans[i-1]+ans[i-2])%3; } int n; while(scanf("%d",&n)!=EOF) { if(ans ==0) puts("yes"); else puts("no"); } return 0; }
相关文章推荐
- Z-Stack分析--main函数
- PERC5/6 RAID如何配置?整合
- aidl笔记
- sleep()和wait()的区别
- USACO 修理牛棚 Barn Repair
- DELL服务器RAID H700,PERC H800阵列卡配置中文完全手册图解
- 监控 Linux Unix Solaris AIX, swap page in / swap page out
- x265探索与研究(六):main()函数
- x265探索与研究(六):main()函数
- RStudio: Warning message: Setting LC_CTYPE failed, using "C" 浅析
- [整理+原创]ubuntu Thunderbird Mail设置自动提醒
- 1090. Highest Price in Supply Chain (25)
- poj 1804 Brainman(求逆序对)
- 虚拟机linux上网问题(http://blog.csdn.net/wqx521/article/details/50832698)
- hdu 4251 The Famous ICPC Team Again(划分树)
- 杂谈之封装main或WinMain启动函数
- http://blog.csdn.net/rainkin1993/article/details/8592617/
- 深度 | 邢波教授谈人工智能科学路径:为人工智能装上「无穷动」引擎
- Genesis Block (Starting a New Blockchain Instance)
- 02 VoLTE - Domain Selection 和 VoLTE Signaling Overview