给定一个整数数组 $a_1, \dots, a_n$ 和一个整数数组 $b_1, \dots, b_n$。
你需要计算数组 $c_1, \dots, c_n$，其定义如下：
$$c_k = \max_{\gcd(i, j)=k} |a_i - b_j|$$
第一行包含一个整数 $n$ ($1 \le n \le 10^5$)。
第二行包含 $n$ 个整数 $a_1, \dots, a_n$ ($1 \le a_i \le 10^9$)。
第三行包含 $n$ 个整数 $b_1, \dots, b_n$ ($1 \le b_i \le 10^9$)。
输出 $n$ 个整数 $c_1, \dots, c_n$。
8 1 2 3 4 5 6 7 8 8 7 6 5 4 3 2 1
7 5 3 3 1 3 5 7
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.
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: