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.
5 2
1 2 3 4 5
10
5 2
1 1 1 2 2
6
此题涉及到排列组合的知识，代码实现能力还不太够，比如：有五个数，要选出三个数两两相乘，最后将其相加，该怎么求？？
扫一扫
112
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
