杭电 HDU 1021 Fibonacci Again
来源:互联网 发布:快手绝世的容颜淘宝店 编辑:程序博客网 时间:2024/06/08 04:05
Fibonacci Again
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 41156 Accepted Submission(s): 19705
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
我说这个题目想当有意思,首先上去就做,压根就没考虑数组溢出n到几百就不行了;最关键的一点是题目要求一种是与否的判断,那就好好找找规律,结果直接让他输出100个f【n】看是否能被3整除的数据是如何分布的,立刻就遇到了惊喜!请看:
#include<iostream>using namespace std;int main(){int n;int *ls=new int [10000000];ls[0]=7;ls[1]=11;for(int i=2;i<100;i++){ls[i]=ls[i-1]+ls[i-2];/*if(ls[i]%3==0) cout<<"yes"<<" "; else cout<<"no"<<" ";*/}while(cin>>n){printf((n-1)%4==1?"yes\n":"no\n");}//printf(ls[n]%3?"no":"yes");return 0;}
结果AC代码能猜出几行么!!呵呵呵
#include<iostream>using namespace std;int main(){int n;while(cin>>n){printf((n-1)%4==1?"yes\n":"no\n");}return 0;}
0 0
- 杭电 HDU 1021 Fibonacci Again
- 杭电1021 Fibonacci Again
- 杭电1021 Fibonacci Again
- 杭电1021 Fibonacci Again
- 杭电1021Fibonacci Again
- 杭电 1021 Fibonacci Again
- [杭电]Fibonacci Again
- 杭电ACM 1021 Fibonacci Again
- 杭电水体--Fibonacci Again 1021
- 杭电acm 1021 Fibonacci Again
- 杭电oj 题目1021Fibonacci Again
- HDU 1021 Fibonacci Again
- HDU 1021 Fibonacci Again
- HDU 1021 Fibonacci Again
- hdu 1021 Fibonacci Again
- hdu 1021 Fibonacci Again
- HDU 1021 Fibonacci Again
- HDU 1021 Fibonacci Again
- 噶v阿飞是东莞办v非敌不过的正方形不菲的
- tiny4412编译android出错
- CentOS 7.0 启用iptables防火墙
- socket函数
- PAT1066(AVL)
- 杭电 HDU 1021 Fibonacci Again
- 点连通度与边连通度的求解
- 判断一个数字是否为回文数
- libcurl的简单使用
- Illegal overloaded getter method with ambiguous type for property
- 基于ngx_lua模块的waf开发实践
- 欢迎使用CSDN-markdown编辑器
- 概率论--随机事件及运算
- 一道淘汰85%面试者的百度开发者面试题