#P16722. 基础模形式练习题

    ID: 19026 远端评测题 4000ms 512MiB 尝试: 1 已通过: 0 显示难度NOI/NOI+/CTS 上传者: 标签>多项式数论线性代数

基础模形式练习题

Background

As everyone knows the following identities hold for any positive integer nn:

$$12\sum_{i+j=n} \sigma_1(i)\sigma_1(j)=5\sigma_3(n)-(6n-1)\sigma_1(n)$$$$192 \sum_{i+j+k=n}\sigma_1(i)\sigma_1(j) \sigma_1(k)=7\sigma_5(n)+(10-30n)\sigma_3(n)+(1-12n+24n^2)\sigma_1(n)$$

How can this property be generalized to the general case?

Problem Description

Let

f(x)=1−24∑i≥1ixi1−xif(x)=1-24\sum_{i \geq 1} \frac{i x^i}{1-x^i}

Given positive integers p,k,np, k, n, where pp is guaranteed to be a prime, find the coefficient of xpnx^{p^n} in f(x)kf(x)^k.
The answer may be very large; you only need to output it modulo 998244353998244353.

Input Format

One line containing three positive integers p,k,np, k, n.

Output Format

Output one integer on one line, representing the answer modulo 998244353998244353.

2 4 3
258593760
5 6 6
177906112
3 18 8
566697133
2 24 17
401935277
2 96 18
36903708

Hint

This problem uses bundled testdata.

Subtask 1 (10 pts): 1≤pn≤1061 \le p^n \le 10^6;
Subtask 2 (20 pts): 1≤k≤61 \le k \le 6;
Subtask 3 (30 pts): 1≤pk/6≤1061 \le p^{k/6} \le 10^6;
Subtask 4 (40 pts): No special constraints.

For all testdata: 1≤k≤961 \le k \le 96, 1≤n≤1091 \le n \le 10^9, p∈{2,3,5,7}p \in \{ 2, 3, 5, 7 \}.

Translated by ChatGPT 5