As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
维多利加给了你一个序列 $a$，每次询问给一个区间 $[l,r]$。
查询 $l \leq i,j\leq r$，且 $a_i$ 是 $a_j$ 倍数的二元组 $(i,j)$ 的个数。
第一行两个整数表示 $n,m$。
第二行 $n$ 个整数表示序列 $a$。
之后 $m$ 行，每行两个整数 $l,r$ 表示一次询问。
对于每个询问，输出一行一个整数表示答案。
6 3
1 1 4 5 1 4
1 1
4 5
1 41
3
10Idea：nzhtl1477，Solution：nzhtl1477，Code：nzhtl1477，Data：nzhtl1477
对于 $100\%$ 的数据，$1\leq n,m,a_i\leq 5\times 10^5$，$1\leq l\leq r\leq n$。
The discussion section is only for posting: Editorials, 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: