3752 . [模板題] Lcm Convolution

Submit
Status
Discussion / Solution
Ranklist
Back to Problems List

TopCoder

din2009siuc

User's AC Ratio

100.0% (2/2)

Submission's AC Ratio

100.0% (2/2)

Tags

library-checker template

Description

Given integer sequences $a_ 1, ..., a_ {N}$ and $b_ 1, ..., b_ {N}$.
Calculate an integer sequence $c_ 1, ..., c_ {N}$ as follows:

$$c_ k = \sum_ {\mathrm{lcm}(i,j)=k} a_ ib_ j \bmod 998244353$$

Input Format

$N$
$a_ 1$ ... $a_ {N}$
$b_ 1$ ... $b_ {N}$

Output Format

$c_ 1$ ... $c_ {N}$

Sample Input 1

6
1 2 3 4 5 6
6 5 4 3 2 1

Sample Output 1

6 27 34 65 42 125

Hints

  • $1 \leq N \leq 10^ {6}$
  • $0 \leq a_ i, b_ i < 998244353$

Problem Source

library checker: lcm_convolution

Subtasks

No. Testdata Range Score

Testdata and Limits

No. Time Limit (ms) Memory Limit (VSS, KiB) Output Limit (KiB) Subtasks
0 5000 2097152 2097152
1 5000 2097152 2097152
2 5000 2097152 2097152
3 5000 2097152 2097152
4 5000 2097152 2097152
5 5000 2097152 2097152
6 5000 2097152 2097152
7 5000 2097152 2097152
8 5000 2097152 2097152
9 5000 2097152 2097152
10 5000 2097152 2097152
11 5000 2097152 2097152
12 5000 2097152 2097152
13 5000 2097152 2097152
14 5000 2097152 2097152
15 5000 2097152 2097152
16 5000 2097152 2097152
17 5000 2097152 2097152
18 5000 2097152 2097152
19 5000 2097152 2097152
20 5000 2097152 2097152
21 5000 2097152 2097152
22 5000 2097152 2097152
23 5000 2097152 2097152
24 5000 2097152 2097152
25 5000 2097152 2097152
26 5000 2097152 2097152
27 5000 2097152 2097152
28 5000 2097152 2097152
Submit
Back to Top