백준 소스코드 [C++] 1010 다리 놓기

www.acmicpc.net/problem/1010

1010번: 다리 놓기

백준 소스코드 [C++] 1010 다리 놓기

#include <iostream>
#include <algorithm>
#include <queue>
#include <string.h>
#include <limits.h>
#include <vector>
#include <math.h>
#include <stack>
#include <bitset>
#include <string>
#include <set>
#define all(v) v.begin(), v.end()
#define pii pair<int,int>
#define make_unique(v) v.erase(unique(v.begin(), v.end()), v.end())
typedef long long ll;
using namespace std;
int arr[29][30] = { 0 };
int num(int L, int R) {
	if (L == R) return 1;
	else if (L == 1) return R;
	else if (arr[L][R] != 0) return arr[L][R];
	else  {
		arr[L][R]=num(L - 1, R - 1) + num(L, R - 1);
		return arr[L][R];
	}
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n;
	cin >> n;
	int left, right;
	while (n--) {
		cin >> left >> right;
		cout << num(left, right) << '\n';

	}
	return 0;
}