杭电2070 Fibbonacci Number

【杭电2070 Fibbonacci Number】的更多相关文章

杭电2070 Fibbonacci Number

Fibbonacci Number Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25027 Accepted Submission(s): 11501 Problem Description Your objective for this question is to develop a program which will g…

Fibbonacci Number(杭电2070)

/*Fibbonacci Number Problem Description Your objective for this question is to develop a program which will generate a fibbonacci number. The fibbonacci function is defined as such: f(0) = 0 f(1) = 1 f(n) = f(n-1) + f(n-2) Your program should be able…

HDU 2070 Fibbonacci Number

Fibbonacci Number Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 13400 Accepted Submission(s): 6677 Problem Description Your objective for this question is to develop a program which will g…

HDUJ 2070 Fibbonacci Number

Fibbonacci Number Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 13234 Accepted Submission(s): 6628 Problem Description Your objective for this question is to develop a program which will g…

[杭电oj][1005]Number Sequence

sky同学在努力地刷题..,在这题卡住了,于是一起研究了一下... 这题本身挺简单的,(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7. 递推公式本身是mod7的...所以f(n-1)和f(n-2)最多只有49种状态,根据鸽巢原理在50以内必定循环. 只要推导出周期和循环的起始位置就行了.一开始只算了周期,没考虑从哪里开始循环,但竟然神奇地AC了...后来想了想觉得不对,应该加入循环的起始位置. 经过手动验证 7 7 49…

杭电oj2031、2033、2070、2071、2075、2089、2090、2092、2096-2099

2031 进制转换 #include<stdio.h> #include<string.h> int main(){ int n,i,r,x,j,flag; ]; while(scanf("%d %d",&n,&r)!=EOF){ flag = ; ){flag=-;n=-n;} i = ; ){ x = n%r; s[i] = x; i++; n = n/r; } ){ printf("-"); } ;j>=;j--…

杭电ACM题单

杭电acm题目分类版本1 1002 简单的大数 1003 DP经典问题,最大连续子段和 1004 简单题 1005 找规律(循环点) 1006 感觉有点BT的题,我到现在还没过 1007 经典问题,最近点对问题,用分治 1008 简单题 1009 贪心 1010 搜索题,剪枝很关键 1011 1012 简单题 1013 简单题(有个小陷阱) 1014 简单题 1015 可以看作搜索题吧 1016 经典的搜索 1017 简单数学题 1018 简单数学题 1019 简单数学题 1020 简单的字符串…