QOJ.ac

QOJ

时间限制: 3 s 内存限制: 1024 MB 总分: 100

#6328. 许多乘积

统计

给定两个正整数 $N$ 和 $M$ 以及一个整数序列 $A = (A_1, A_2, \dots, A_N)$。令 $\boldsymbol{X}$ 为所有满足 $\prod_{i=1}^N x_i = M$ 的正整数 $N$ 元组 $(x_1, x_2, \dots, x_N)$ 的集合。

求以下值对 $998244353$ 取模的结果:

$$\sum_{(x_1, x_2, \dots, x_N) \in \boldsymbol{X}} \prod_{i=1}^N (x_i + A_i)$$

输入格式

输入通过标准输入给出,格式如下:

$N \ M$ $A_1 \ A_2 \dots A_N$

  • 输入中的所有值均为整数。
  • $1 \le N \le 2 \times 10^5$
  • $1 \le M \le 10^{12}$
  • $0 \le A_i < 998244353 \ (1 \le i \le N)$

输出格式

输出答案。

样例

样例输入 1

2 3
0 1

样例输出 1

10

样例输入 2

5 1
0 1 2 3 4

样例输出 2

120

样例输入 3

10 314159265358
0 1 2 3 4 5 6 7 8 9

样例输出 3

658270849

说明

在第一个样例中,$\boldsymbol{X} = \{(1, 3), (3, 1)\}$,答案为 $(1 + 0)(3 + 1) + (3 + 0)(1 + 1) = 10$。

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.