基本思想:
打表、递归、dp都可以;
关键点:
无;
#include<iostream> using namespace std; const int maxn = 25; int n; int dp[maxn]; int main() { while (cin >> n) { dp[1] = 1; dp[2] = 2; for (int i = 3; i <= n; i++) { dp[i] = dp[i - 1] + dp[i - 2]; } cout << dp[n] << endl; } return 0; }