DP
//dp[i][j] = dp[i - 1][j] + dp[i - 1][j - 1]
#include <iostream>
#include <string.h>
using namespace std;
using LL = long long;
LL dp[41][41];
int main() {
int num;
cin >> num;
for (int k = 0; k < num; ++k) {
int m, n;
cin >> m >> n;
memset(dp, 0, sizeof(dp));
for (int i = 0; i <= m; ++i) {
dp[i][0] = 1;
}
for (int i = 1; i <= m; ++i) {
for (int j = 1; j <= n; ++j) {
dp[i][j] = dp[i - 1][j] + dp[i - 1][j - 1];
}
}
cout<<"case #"<<k<<":"<<endl;
cout << dp[m][n] << endl;
}
return 0;
}
评论区的格式异常的怪,开头核心思想那里并在一坨的数字之间是相乘的关系哈,212223