QOJ.ac

QOJ

Time Limit: 2.5 s Memory Limit: 500 MB Total points: 100

#7493. 此时此刻的光辉

统计

题目描述

珂朵莉给你了一个长为 $n$ 的序列,有 $m$ 次查询,每次查询一段区间的乘积的约数个数 $\bmod 19260817$ 的值。

输入格式

第一行两个整数 $n,m$。

第二行 $n$ 个整数表示这个序列 $a_i$。

之后 $m$ 行,每行两个整数 $l,r$ 表示查询的区间

输出格式

$m$ 行,每行输出一个整数表示答案

样例 #1

样例输入 #1

5 5
64 2 18 9 100
1 5
2 4
2 3
1 4
3 4

样例输出 #1

165
15
9
45
10

提示

Idea:will7101,Solution:nzhtl1477,Code:nzhtl1477,Data:nzhtl1477

$1\leq n,m\leq 10^5$,$1 \leq a_i \leq10^9$。

Discussions

About Discussions

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.

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. Submitting multiple issues may cause your account to be banned.
  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.