HDOJ 2070 Fibbonacci Number

来源：互联网发布：李开复人工智能txt 编辑：程序博客网时间：2024/04/28 10:31

题意：f(0)=0，f(1)=1，求Fibbonacci数列的第n个值

链接：http://acm.hdu.edu.cn/showproblem.php?pid=2070

思路：预处理，递推均可

注意点：爆int，用long long

以下为AC代码：

Run IDSubmit TimeJudge StatusPro.IDExe.TimeExe.MemoryCode Len.LanguageAuthor125978052014-12-27 22:15:09Accepted207031MS1224K889 BG++luminous11

#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <vector>#include <deque>#include <list>#include <cctype>#include <algorithm>#include <climits>#include <queue>#include <stack>#include <cmath>#include <map>#include <set>#include <iomanip>#include <cstdlib>#include <ctime>#define ll long long#define ull unsigned long long#define all(x) (x).begin(), (x).end()#define clr(a, v) memset( a , v , sizeof(a) )#define pb push_back#define mp make_pair#define read(f) freopen(f, "r", stdin)#define write(f) freopen(f, "w", stdout)using namespace std;int main(){    long long num[1<<10] = { 0, 1, 1 };    for ( int i = 3; i <= 50; i ++ )    {        num[i] = num[i-1] + num[i-2];    }    int t;    while ( cin >> t && t != -1 )    {        cout << num[t] << endl;    }    return 0;}

0 0