La idea básica:
mesa de juego, la recursividad, lata dp;
Puntos clave:
No;
#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; }