奖品分配c++

最新推荐文章于 2026-01-02 18:47:06 发布

原创最新推荐文章于 2026-01-02 18:47:06 发布 · 280 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

GEO检测

标签

#c++ #算法 #图论

收录于

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>

using namespace std;
const int N = 1005;
const int mod = 1e9 + 7;
int C[N + 5][N + 5], a[N + 5];
void add(int &a, int b) {
  a += b;
  if (a >= mod)
    a -= mod;
}
void init() {
  C[0][0] = 1;
  for (int i = 1; i <= N; i++) {
    C[i][0] = C[i][i] = 1;
    for (int j = 1; j < i; j++)
      C[i][j] = C[i - 1][j - 1], add(C[i][j], C[i - 1][j]);
  }
}
int main() {
  // freopen("data/10.in", "r", stdin);
  init();
  int T;
  scanf("%d", &T);
  while (T--) {
    int n, m, sum = 0;
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= m; i++)
      scanf("%d", &a[i]), sum += a[i];

    int ans = 1;
    for (int i = 1; i <= m; i++) {
      ans = 1ll * ans * C[sum][a[i]] % mod;
      sum -= a[i];
    }
    cout << ans << endl;
  }
  return 0;
}

代码