题目:Mathematical Practice | JXNUOJ
描述:
Kamishirasawa Keine always says, "If you don't know what to do, why not give mathematical practice a try."
However, Cirno is way too much talented to work on simple problems. Therefore, you are now tasked to crack one.
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).
Now you need to figure out how many possible operations that the m selected subsets are pairwise disjoint.
As the answer may get very large, you need to print the answer after modulo 998244353998244353.
Kamishirasawa Keine总是说“如果你不知道做什么,为什么不尝试做数学练习。”
然而,Cirno太有天赋而不能解决简单的问题。因此,你被安排去解决一道。
我们考虑对集合S进行一个操作,有序选择m个集合S的子集(可以选择同一个子集多次,被选择的子集可以是空集)。
现在你需要找出有多少可能的操作可以使得m个子集成对不相交。
输入:
The input contains one line with two integers n and m(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),n是集合S的大小,m是在一次操作中被选择的子集的数量。
输出:
Print one integer, the number of possible operations above after modulo 998244353998244353.
输出一个整数,可能的操作的数量(取模后)
词汇:
crack 解决问题;打击,阻止 way 很远,大量 task 交给某人任务 subset 子集