Skip to content
TheChatArchiveThe Chat Archive
Human-written demonstration (OpenAssistant volunteers)· OpenAssistant (human-written)Hugging Face OpenAssistant Conversations (oasst2)

Escribe un programa en C++ para calcular el enésimo número de la sucesión de Fibonacci…

In OpenAssistant data, “assistant” turns were written by human volunteers as demonstrations. They are not model outputs.
  1. User

    Escribe un programa en C++ para calcular el enésimo número de la sucesión de Fibonacci utilizando programación dinámica con enfoque top-down y otro bottom-up.

  2. Assistant

    Aquí están los programas en C++ que calculan el enésimo número de la sucesión de Fibonacci utilizando programación dinámica con enfoque top-down y bottom-up:

    Enfoque top-down: #include #include <unordered_map>

    using namespace std;

    unordered_map<int, int> memo;

    int fib_top_down(int n) { if (n == 0) return 0; if (n == 1) return 1; if (memo.count(n)) return memo[n]; int result = fib_top_down(n - 1) + fib_top_down(n - 2); memo[n] = result; return result; }

    int main() { int n; cout << "Enter the value of n: "; cin >> n; cout << "The nth Fibonacci number is: " << fib_top_down(n) << endl; return 0; }

    Enfoque bottom-up:

    #include #include

    using namespace std;

    vector fib_bottom_up(int n) { vector result(n + 1); result[0] = 0; result[1] = 1; for (int i = 2; i <= n; i++) { result[i] = result[i - 1] + result[i - 2]; } return result; }

    int main() { int n; cout << "Enter the value of n: "; cin >> n; cout << "The nth Fibonacci number is: " << fib_bottom_up(n)[n] << endl; return 0; }

Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.