Contest Setting —— dp求n种数取m个的情况数

A group of contest writers have written n problems and want to use k of them in an upcoming contest. Each problem has a difficulty level. A contest is valid if all of its k problems have different difficulty levels.
Compute how many distinct valid contests the contest writers can produce. Two contests are distinct if and only if there exists some problem present in one contest but not present in the other.
Print the result modulo 998,244,353.
Input
The first line of input contains two space-separated integers n and k (1 ≤ k ≤ n ≤ 1000). The next line contains n space-separated integers representing the difficulty levels. The difficulty levels are between 1 and 109 (inclusive).
Output
Print the number of distinct contests possible, modulo 998,244,353.
Sample Input and Output
5 2 1 2 3 4 5
10
5 2 1 1 1 2 2
6
12 5 3 1 4 1 5 9 2 6 5 3 5 8
316

题意：

给你n个数，m种不同的数可以组成一场比赛，问你最多能组成多少场比赛。

题解：

dp[i][j]表示有i种数的时候j种组成比赛的数目，那么状态转移方程就是
dp[i][j]=((dp[i-1][j-1]*num[i])%mod+dp[i-1][j])%mod;

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1e3+5;
const ll mod=998244353;
ll dp[N][N],num[N];
int a[N],b[N];
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]),b[i]=a[i];
    sort(b+1,b+1+n);
    int all=unique(b+1,b+1+n)-b-1;
    for(int i=1;i<=n;i++)
        a[i]=lower_bound(b+1,b+1+all,a[i])-b,num[a[i]]++;
    for(int i=0;i<N;i++)
        dp[i][0]=1;
    for(int i=1;i<=all;i++)
        for(int j=1;j<=m;j++)
            dp[i][j]=((dp[i-1][j-1]*num[i])%mod+dp[i-1][j])%mod;
    printf("%lld\n",dp[all][m]);
    return 0;
}