【正经题解】Gold King精品工程

#include <iostream>
using namespace std;
int main() {
    long long n, ways[61];
    cin >> n;

    ways[1] = 1, ways[2] = 2;
    for (int i = 3; i <= n; i++) {
        ways[i] = ways[i - 1] + ways[i - 2];
    }

    cout << ways[n];
    return 0;
}