HDOJ 1250 Hat's Fibonacci （大数的加法）

Hat's Fibonacci

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 2335 Accepted Submission(s): 903

Problem Description A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1. F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n - 1) + F(n-2) + F(n-3) + F(n-4) Your task is to take a number as input, and print that Fibonacci number.

Input Each line will contain an integers. Process to end of file.

Output For each case, output the result in a line.

Sample Input 100

Sample Output 4203968145672990846840663646 Note: No generated Fibonacci number in excess of 2005 digits will be in the test data, ie. F(20) = 66526 has 5 digits.       这个就是大数加法  因为就4个数组按顺序轮流来的  可以把新的值把最小的值覆盖掉   看起来就简洁多了   #include #include #include #include using namespace std; int main() { int n; while (cin >> n) { int a[5][2020] = {0}; if (n <= 4) { cout << "1" << endl; continue; } a[0][0] = a[1][0] = a[2][0] = a[3][0] = 1; for (int i = 4; i < n; i++) { for (int j = 0;j<2020; j++) { a[i % 4][j] = a[0][j] + a[1][j] + a[2][j] + a[3][j]; a[i % 4][j + 1] += a[i % 4][j] / 10; a[i % 4][j] = a[i % 4][j]%10; //if (a[0][j] == 0 && a[1][j] == 0 && a[2][j] == 0 && a[3][j] == 0 && a[i % 4][j + 1] == 0)break; //就因为加了这个判定条件WA了 } } int p; for (int i = 2010; i>=0; i--) { if (a[(n - 1) % 4][i] != 0) { p = i; break; } } while (p>=0) { cout << a[(n - 1) % 4][p]; p--; } cout << endl; } return 0; }