QOJ.ac

QOJ

Time Limit: 3 s Memory Limit: 512 MB Total points: 100

#10933. 最大值

統計

Nasshitaka4692 现在有 $n$ 个变量 $a_1,\dots,a_n$ 初始为 $0$,接下来他会做 $k$ 轮操作。每次他会等概率随机选择一个变量并将其 $+1$。他想知道 $\max \{a_1,\dots,a_n\}$ 的期望。你只需要帮他求出这个期望值乘以 $n^k$ 的结果,同余 $998244353$。

输入格式

输入两个正整数 $n,k$。

输出格式

输出一个数,表示答案。

样例数据

样例 1 输入

2 5

样例 1 输出

110

样例 2 输入

4 6

样例 2 输出

11544

样例 3 输入

10 66

样例 3 输出

686029191

子任务

对于 $100\%$ 的数据,保证 $1\le n\le 10, 1\le k\le 10^5$。

  • 测试点 $1,2$ 分别保证 $n=1,2$。
  • 对于测试点 $i(3\le i\le 20)$,保证 $k\le 10^{(i+10)/6}$。
About Issues

We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.

You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.

STOP! Before you submit an issue, please READ the following guidelines:

  1. This is not a place to publish a discussion, editorial, or requests to debug your code. Your issue will only be visible by you and problem moderators. Other users will not be able to view or reply your issues.
  2. Do not submit duplicated issues. If you have already submitted one, please wait for an moderator to review it. Submitting multiple issues will not speed up the review process and might cause your account to be banned.
  3. Issues must be filed in English or Chinese only.
  4. Be sure your issue is related to this problem. If you need to submit an issue regarding another problem, contest, category, etc., you should submit it to the corresponding page.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0

No issues in this category.