题目地址:https://acs.jxnu.edu.cn/problem/ICPCJX2020G
Mathematical Practice
数学实践
描述:
Kamishirasawa Keine always says, "If you don't know what to do, why not give mathematical practice a try."
Kamishirasawa Keine总是说:“如果你不知道去做什么,为什么不尝试去进行数学实践”
However, Cirno is way too much talented to work on simple problems. Therefore, you are now tasked to crack one.
然而,Cirno很有天赋去解决简单的问题。因此,你现在的任务是破解一个。
We consider one operation on a set S as selecting m subsets of S in order (You can select the same subset multiple times and the selected subset can be empty).
我们考虑集合S上的一个操作,以选择S的M子集。(你可以多次选择相同的子集和被选择的子集可以为空)
Now you need to figure out how many possible operations that the m selected subsets are pairwise disjoint.
现在,您需要计算所选子集m成对不相交的可能操作数。
As the answer may get very large, you need to print the answer after modulo 998244353998244353.
由于答案可能会变得非常大,您需要在模998244353998244353之后打印答案。
输入:
The input contains one line with two integers n and m(1≤n,m≤109)(1≤n,m≤109), where n is the size of set S and m is the number of subsets to be selected in one operation.
输入包括一行为两个整数n 和 m(1≤n,m≤109)(1≤n,m≤109),n是集合S的大小,m是再一次操作中被选择的子集的数量。
输出:
Print one integer, the number of possible operations above after modulo 998244353998244353.
输出一个整数,在模为998244353998244353之后,上面可能的操作数。
样例输入:
3 2
样例输出:
27
样例输入:
1000 25
样例输出:
605425003