알고리즘/KOALA 알고리즘 스터디
[BOJ/C++] 2775 부녀회장이 될테야
햄스타배
2025. 6. 1. 00:05
#include<iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int T,k,n;
cin >> T;
int f[15][14] = {};
for (int i = 0; i < 15; i++) {
for (int j = 0; j < 14; j++) {
if (i == 0)
f[i][j] = j+1;
else if (j == 0)
f[i][j] = 1;
else {
f[i][j] = f[i - 1][j] + f[i][j - 1];
}
}
}
for (int c = 0; c < T; c++){
cin >> k >> n;
cout << f[k][n - 1] << "\n";
}
return 0;
}
https://www.acmicpc.net/problem/2775
