[백준 1010] 다리 놓기 (DP) (C/C++)

#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
 
int T;
int west, east;
long long dp[35][35];
 
long long solve(int e, int w)
{
    if(w == 0 || (e == w))
    {
        return 1;
    }
    
    if(dp[e][w] != 0)
    {
        return dp[e][w];
    }
    
    dp[e][w] = solve(e-1, w-1) + solve(e-1, w);
    
    return dp[e][w];;
}
 
int main(void)
{
//    freopen("B1010_input.txt", "r", stdin);
    
    cin >> T;
    
    while(T--)
    {
        memset(dp, 0, sizeof(dp));
        
        cin >> west >> east;
        
        cout << solve(east, west) << "\n";
    }
    
    return 0;
}