#include <iostream> using namespace std; int main() { int arr[50]; arr[1] = 1; arr[2] = 1; int add = 0; int n = 0; cin >> n; for (int i = 3; i <= n; i++) { arr[i] = arr[i - 1] + arr[i - 2]; } add = arr[n]; cout << add << endl; return 0; }就是一个简单的递推算法
#include <iostream> using namespace std; int main() { int arr[50]; arr[1] = 1; arr[2] = 1; int add = 0; int n = 0; cin >> n; for (int i = 3; i <= n; i++) { arr[i] = arr[i - 1] + arr[i - 2]; } add = arr[n]; cout << add << endl; return 0; }就是一个简单的递推算法