提交时间:2023-10-15 15:50:30
运行 ID: 106818
#include<iostream> using namespace std; #define MAX 9999 int f[1001][MAX]; int len; void fun(int x) { for (int i = 0; i < len; i++) { f[x][i] += f[x - 1][i] + f[x - 2][i]; if (f[x][i] > 9) { f[x][i + 1]++;f[x][i] -= 10; } if (i == len - 1 && f[x][len]) len++; } } int main(){ int m, n; cin >> m >> n; f[1][0] = 1; f[2][0] = 1; len = 1; int x = n - m + 1; for (int i = 3; i <=x; i++) { fun(i); } while (f[x][len - 1] == 0 && len > 1) len--; for (int i = len-1; i >=0; i--) cout << f[x][i];return 0; }