Fibonacci Again
2015-07-27 08:33
471 查看
Fibonacci Again
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 44035 Accepted Submission(s): 21020
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
http://acm.hdu.edu.cn/showproblem.php?pid=1021
先打出前50个的数的答案发现他有一种规律,要推得话也是可以的,7%3=1,11%3=2,那么(7+11)%3一定是0,后面余数分别是2,2,1,0,1,1,2,0.。。。。。。
so代码如下:
#include <cstdio> int main() { int n; while(scanf("%d",&n)!=EOF){ if(n==0||n==1)printf("no\n"); else if(n%4==2)printf("yes\n"); else printf("no\n"); } return 0; }
相关文章推荐
- AirPlay、DLNA、Miracast三大无线技术介绍
- 中小企业TurboMail邮件系统建设方案指导
- linux 进程等待 wait 、 waitpid
- hd2674 N!Again
- [leetcode-11]container with most water(C)
- 【LeetCode】70 - Climbing Stairs
- RAII手法封装互斥锁
- assign、copy、retain、weak、strong的区别与联系
- DataInputStream和DataOutputStream操作基本数据类型的流
- Fine-Grained Histopathological Image Analysis via Robust Segmentation and Large-Scale Retrieval文章总结
- Contains Duplicate
- hdu 5289 - Assignment(2015 Multi-University Training Contest 1 )单调队列+RMQ+树状数组
- Could not find a storyboard named 'MainStoryboard'
- 如何让gmail不过滤垃圾邮件
- 5.4 QEMU block & AIO
- hdu2464 A Pair of Graphs 线段树
- scikit-learn:4.7. Pairwise metrics, Affinities and Kernels
- ssh中“Host key verification failed.“的解决方案
- 14级第一次测试 E - The Snail
- HDU-2675 Equation Again