백준 2775 : 부녀회장이 될테야

소스코드

#include <iostream>
using namespace std;
 
int main() {
 
    int apart[15][15];
    apart[0][0] = 1;
    int t, a, b = 0;
 
        for (int i = 1; i < 15; i++) {
            apart[0][i] = i+1;
            apart[i][0] = 1;
        }
 
        for (int j = 1; j < 15; j++) {
            for (int k = 1; k < 15; k++) {
                apart[j][k] = apart[j][k - 1] + apart[j - 1][k];
            }
        }
 
        cin >> t;
 
        for (int i = 0; i < t; i++) {
            cin >> a >> b;
            cout << apart[a][b-1] << endl;  
    }
    return 0;
}