[BAE/<JOON> 문제풀이] 1010. 다리놓기 (DP.017)

https://www.acmicpc.net/problem/1010

1010번: 다리 놓기

#include <iostream>
#include <vector>

using namespace std;

int main()
{
    vector<unsigned long> arr;
    vector<vector<unsigned long>> dp;
    int tc;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        int n, m;
        cin >> n >> m;
        dp.resize(m + 1);
        for (int i = 1; i <= m; i++) {
            dp[i].resize(i + 2);
        }
        dp[1][0] = 1;
        dp[1][1] = 1;        
        for (int i = 2; i <= m; i++) {
            dp[i][0] = 1;
            for (int j = 1; j <= i; j++) {
                dp[i][j] = dp[i - 1][j] + dp[i - 1][j - 1];
            }
        }
        cout << dp[m][n] << endl;
    }
    return 0;
}