hw软件笔试,Dota技能
大佬看看哪里不对。
#include<iostream>
#include <vector>
using namespace std;
long long Combinations(int n, int m)
{
vector<vector<long long>>dp(n + 1, vector<long long>(m + 1, 0));
for (int i = 0; i <= n; ++i)
{
dp[i][0] = 1;
}
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= m; ++j)
{
for (int k = 0; k <= j; ++k)
{
dp[i][j] += dp[i - 1][j - k];
}
}
}
return dp[n][m];
}
int main()
{
int n, m;
cin >> n;
cin >> m;
if (n == 0 && m == 0)return 0;
if (m == 1)return n;
long long count = Combinations(n, m);
cout << count % 1000000007;
return 0;
}
#笔试题目##华为#


