[백준 2688번] 줄어들지 않아

소스코드

---

#include <iostream>
using namespace std;
 
int main() {
    int tc;
    cin >> tc;
    while (tc>0) {
        long long dp[65][11], n;
        cin >> n;
        if (n == 1) {
            cout << 10 << '\n';
            tc--;
            continue;
        }
        for (int i = 1; i <= 10; i++) {
            dp[1][i] = i;
        }
        for (int i = 2; i < n; i++) {
            dp[i][1] = 1;
            for (int j = 2; j <= 10; j++) {
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }
        long long sum = 0;
        for (int i = 1; i <= 10; i++)
            sum += dp[n - 1][i];
        cout << sum << '\n';
        tc--;
    }
    return 0;
}